【Leetcode刷题笔记】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".

思路：本题的意思就是需要我们判断字符串p的各种顺序形态在字符串s中是否出现过 。首先想到的最笨的方法就是判断p的字符的排列组合，然后在字符串s中，依次遍历。但是这样做时间复杂度无疑是非常大的。
故而，可以采用hash的方式，因为是任意顺序都可以，所以只需要判断在p长度范围内。s出现的字符是否和p所有的字符的个数相同即可。
仍然有两种解法：
1.比较笨的解法
2.滑动窗口解法

    vector<int> findAnagrams(string s, string p) {
        vector<int>res,table(128,0);
        vector<int>tem;
        int _s= s.size();
        int _p= p.size();
        for(char c : p)table[c]++;
        int i =0;
        while(i<_s){
            tem= table;
            bool flag = false;
            for(int j=i;j<i+_p;j++){
            	if(--tem[s[j]]<0){
            		flag=false;
            		break;
            	}
            }
            	if(flag)res.push_back(i);
            	i++;
        }
        return res;
    }

vector<int> findAnagrams(string s, string p) {
        vector<int>res,table(128,0);
        int _s= s.size();
        int _p= p.size();
        int left = 0,right = 0;
        for(char c : p){
            table[c]++;
        }
        int count = _p;
        while(right<_s){
            if(table[s[right++]]-- > 0)count--;
            if(count==0){
                res.push_back(left);
            }
            if(right - left == _p && table[s[left++]]++>=0)count++;
        }
        return res;
    }

滑动窗口对于处理字符串还是非常实用的