[leetcode]438. Find All Anagrams in a String

题目链接：https://leetcode.com/problems/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".

class Solution {
public:
                vector<int> findAnagrams(string s, string p) {  
        vector<int> ans;  
        int n=s.size(),m=p.size();  
        vector<int> h1(26),h2(26);  
        for(int i=0;i<m;i++)  
        h1[p[i]-'a']++;  
        for(int i=0;i<n;i++)  
        {  
             h2[s[i]-'a']++;  
            if(i>=m)  
                h2[s[i-m]-'a']--;  
           if(h1==h2)  
           ans.push_back(i-m+1);  
        }  
        return ans;  
    }  


};