916

Author: ProHiryu

DFS/traditionalDFS/916.md

@@ -0,0 +1,34 @@
+## [916] Word Subsets
+
+#### Description
+
+[link](https://leetcode.com/problems/word-subsets/)
+
+---
+
+#### Solution
+
+- See Code
+
+---
+
+#### Code
+
+> 最坏情况：O(n^2)
+
+```python
+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
+```