916. 单词子集(思维)

class Solution {
public:
    map<char,int> mb;
    bool Check(string& str,int& len){
        map<char,int> ma;
        for(int i=0;i<str.length();i++){
            ma[str[i]] ++;
        }
        for(auto i : mb){
          if(ma[i.first] < i.second) return false;
        }
        return true;
    }
    vector<string> wordSubsets(vector<string>& A, vector<string>& B) {
        int lenA = A.size();
        int lenB = B.size();
        for(int i=0;i<lenB;i++){
            map<char,int> m;
            for(int j=0;j<B[i].length();j++){
                m[B[i][j]] ++;
                mb[B[i][j]] = max(mb[B[i][j]], m[B[i][j]]);
            }
        }
        vector<string> ans;
        for(int i=0;i<lenA;i++){
            if(Check(A[i], lenB)){
                ans.push_back(A[i]);
            }
        }
        return ans;
    }
};