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”.
Solution:
#include <iostream>
#include <vector>
using namespace std;
class Solution {
public:
vector<int> findAnagrams(string s, string p) {
vector<int> res;
if ( s.size() < p.size() )
return res;
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;
while ( r + 1 < s.size() ){
r++;
freq_s[s[r] - 'a']++;
if ( r-l+1 > p.size() ){
freq_s[s[l] - 'a'] --;
l++;
}
if ( r-l+1 == p.size() && isSame(freq_s, freq_p) )
res.push_back(l);
}
return res;
}
private:
bool isSame(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;
}
};
总结:刚开始没有想到用频次来判断是不是字母异位词!!!用到了平滑窗口的思想。