개발 로그/알고리즘

1967. Number of Strings That Appear as Substrings in Word.cpp

CyberSoak 2021. 10. 6. 22:47

find 활용 하면 빠름.

class Solution {
public:
    int numOfStrings(vector<string>& patterns, string word) {
        int res =0;
        for(int i =0; i< patterns.size();i++){
            if(patterns[i].size()>word.size()) continue;
            for(int j =0; j< word.size()-(patterns[i].size())+1; j++){
                if(patterns[i]==word.substr(j,patterns[i].size())){
                    res++;
                    break;
                }
            }
        }
        return res;
    }
};


//better solution
class Solution {
public:
    int numOfStrings(vector<string>& patterns, string word) {
        int res =0;
        for(int i =0; i< patterns.size();i++){
            if(word.find(patterns[i])!=-1)res++;
        }
        return res;
    }
};