leetcode438. Find All Anagrams in a String（滑动窗口）（理解尚差）

题目描述

Given a string s and a non-empty string p, find all the start indices of p’s anagrams in s.

Strings consists of lowercase English letters only and the length of both strings s and p will not be larger than 20,100.

The order of output does not matter.

Example 1:

Input:
s: “cbaebabacd” p: “abc”

Output:
[0, 6]

Explanation:
The substring with start index = 0 is “cba”, which is an anagram of “abc”.
The substring with start index = 6 is “bac”, which is an anagram of “abc”.

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/find-all-anagrams-in-a-string
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

代码

#include <iostream>
#include <vector>
#include <string>
#include <cassert>

using namespace std;

/// Sliding Window
/// Time Complexity: O(len(p) + len(s))
/// Space Complexity: O(1)
class Solution {
public:
    vector<int> findAnagrams(string s, string p) {

        vector<int> res;
        if(s.size() < p.size())
            return res;

        assert(p.size() > 0);

        vector<int> freq_p(26, 0);
        for(char c: p)
            freq_p[c - 'a'] += 1;

        vector<int> freq_s(26, 0);
        int l = 0, r = -1; // Sliding window: s[l, r]
        while(r + 1 < s.size()){
            r ++;
            freq_s[s[r] - 'a'] ++;
            if(r - l + 1 > p.size())
                freq_s[s[l++] - 'a'] --;

            if(r - l + 1 == p.size() && same(freq_s, freq_p))
                res.push_back(l);
        }

        return res;
    }

private:
    bool same(const vector<int>& freq_s, const vector<int>& freq_p){
        for(int i = 0 ; i < 26; i ++)
            if(freq_s[i] != freq_p[i])
                return false;
        return true;
    }
};


void printVec(const vector<int>& vec){
    for(int e: vec)
        cout << e << " ";
    cout << endl;
}

int main() {

    string s1 = "cbaebabacd";
    string p1 = "abc";
    printVec(Solution().findAnagrams(s1, p1));
    // [0, 6]

    // ---

    string s2 = "abab";
    string p2 = "ab";
    printVec(Solution().findAnagrams(s2, p2));

    return 0;
}

思路

https://leetcode-cn.com/problems/find-all-anagrams-in-a-string/solution/hua-dong-chuang-kou-tong-yong-si-xiang-jie-jue-zi-/