题解 | 子串判断

#include <vector>
class Substr {
public:
    vector<bool> chkSubStr(vector<string> p, int n, string s) {
        // write code here
        vector<bool> res(p.size(), false);
        for(int i=0;i<n;++i){
            if(s.find(p[i]) != -1){
                res[i] = true;
            }
        }
        return res;

    }
};