Time: 67 ms (46.58%) | Memory: 106.9 MB (33.79%) - LeetSync

Author: sayandip20

952-word-subsets/word-subsets.cpp

@@ -0,0 +1,27 @@
+class Solution {
+public:
+    vector<string> wordSubsets(vector<string>& A, vector<string>& B) {
+        vector<int> count(26), tmp(26);
+        int i;
+        for (string b : B) {
+            tmp = counter(b);
+            for (i = 0; i < 26; ++i)
+                count[i] = max(count[i], tmp[i]);
+        }
+        vector<string> res;
+        for (string a : A) {
+            tmp = counter(a);
+            for (i = 0; i < 26; ++i)
+                if (tmp[i] < count[i])
+                    break;
+            if (i == 26) res.push_back(a);
+        }
+        return res;
+    }
+
+    vector<int> counter(string& word) {
+        vector<int> count(26);
+        for (char c : word) count[c - 'a']++;
+        return count;
+    }
+};