【Leetcode_easy】1078. Occurrences After Bigram

problem

1078. Occurrences After Bigram

题意

solution:

class Solution {
public:
    vector<string> findOcurrences(string text, string first, string second) {
        string bigram = first + ' ' + second + ' ';
        vector<string> res;
        int n = bigram.size();
        auto p = text.find(bigram);
        while(p != string::npos)
        {
            auto p1 = p+n, p2 = p1;
            while(p2<text.size() && text[p2]!=' ') p2++;
            res.push_back(text.substr(p1, p2-p1));//err...
            p = text.find(bigram, p+1);
        }
        return res;
    }
};

参考

1. Leetcode_easy_1078. Occurrences After Bigram;

2. string_find;

3. discuss;

4. string_substr;

完