好似第二題咁
睇完個問題,好明顯
string s from words1 is universal iff the multiplicity of each character in s is at least the max multiplicity of the same character in any string from words2
所以words2基本上只係一條string and the rest is trivial
裂曲風紀2022-05-29 04:42:02
yes your approach is spot on ah
but I don't think it is straightforward to beginners who just started Leetcode 4 days ago...