Today's Challenge

https://leetcode.com/problems/word-subsets/

Word Subsets - LeetCode

n이 그렇게 크지 않아서 무식하게 두 번 loop 돌리면 됨.

class Solution:
    def wordSubsets(self, words1: List[str], words2: List[str]) -> List[str]:
        def count(word):
            ans = [0 for _ in range(26)]
            for l in word:
                ans[ord(l) - ord('a')] += 1
            return ans
        
        ar = [0 for _ in range(26)]
        for w2 in words2:
            for i, c in enumerate(count(w2)):
                ar[i] = max(ar[i], c)
                
        ans = []
        for a in words1:
            if all(x >= y for x, y in zip(count(a), ar)):
                ans.append(a)
        return ans