【leetcode】438. Find All Anagrams in a String

438. 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".

Example 2:

Input:
s: "abab" p: "ab"

Output:
[0, 1, 2]

Explanation:
The substring with start index = 0 is "ab", which is an anagram of "ab".
The substring with start index = 1 is "ba", which is an anagram of "ab".
The substring with start index = 2 is "ab", which is an anagram of "ab".

题目链接：https://leetcode.com/problems/find-all-anagrams-in-a-string/

解法：固定大小的滑动窗口

class Solution {
public:
    vector<int> findAnagrams(string s, string p) {
        vector<int> res;
        int lens = s.length();
        int lenp = p.length();
        if(lenp>lens) return res;
        int charlist[26]={0}, tmp[26]={0};
        for(int i=0;i<lenp;++i){
            charlist[p[i]-'a']++;
            tmp[s[i]-'a']++;
        }
        int l = 0, r=lenp-1;
        while(true){
            if(isEqual(tmp, charlist)){
                res.push_back(l);
            }
            if(r+1<lens){
                tmp[s[l++]-'a']--;
                tmp[s[++r]-'a']++;
            }else break;
        }
        return res;
    }
    bool isEqual(int a[], int b[]){
        int len=26;
        for (int i=0; i<len;++i){
            if(a[i]!=b[i]) return false;
        }
        return true;
    }
};

！注意：数组的传参，arr传递的是指针