916.md

[916] Word Subsets

Description

link

---

Solution

• See Code

---

Code

最坏情况：O(n^2)

class Solution:
    def wordSubsets(self, A: List[str], B: List[str]) -> List[str]:
        cnt = collections.Counter()
        for b in B:
            c = collections.Counter(b)
            for i, x in c.items():
                cnt[i] = max(x, cnt[i])

        res = []
        for a in A:
            c = collections.Counter(a)
            if all(c[i] >= cnt[i] for i in cnt.keys()):
                res.append(a)
        return res