### LeetCode  • ㊗️
• 大家
• offer
• 多多！

## Problem

Given two strings s and p, return an array of all the start indices of p’s anagrams in s. You may return the answer in any order.

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


## Code

567. Permutation in String

class Solution {
public List<Integer> findAnagrams(String s, String p) {
int[] dict = new int;
int[] curr = new int;
List<Integer> res = new ArrayList<>();

for(int i = 0; i < s.length(); i++){
curr[s.charAt(i) - 'a']++;

if(i < p.length()) {
dict[p.charAt(i) - 'a']++;

if(i == p.length() - 1 && helper(dict, curr)) {
}
} else {
curr[s.charAt(i - p.length()) - 'a']--;

if(helper(dict, curr)) {
}
}
}

return res;
}

private boolean helper(int[] dict, int[] curr) {
for(int i = 0; i < 26; i++) {
if(dict[i] != curr[i]) return false;
}

return true;
}
}