LeetCode-Find All Anagrams in a String

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

题意：给定一个字符串s和一个匹配串p，找出s中的所有子串，使其满足与匹配串相同(不考虑字符顺序，即只要包含的字符相同即可);

解法：既然不考虑顺序，我们可以利用哈希表来实现；首先，我们用哈希表存储匹配串中的字符出现次数；之后，遍历字符串s的所有长度为p.length()的所示子串，统计子串中所有字符及出现次数是否与哈希表匹配；

Java

class Solution {
    public List<Integer> findAnagrams(String s, String p) {
        Map<Character, Integer> anagram = new HashMap<>(26);
        List<Integer> res = new ArrayList<>();
        for (int i = 0; i < p.length(); i++) {
            anagram.put(p.charAt(i), anagram.getOrDefault(p.charAt(i), 0) + 1);
        }
        for (int st = 0; st + p.length() <= s.length(); st++) {
            Map<Character, Integer> temp = new HashMap<>(anagram);
            int cnt = 0;
            for (int i = st; i < st + p.length(); i++) {
                temp.put(s.charAt(i), temp.getOrDefault(s.charAt(i), 0) - 1);
                if (temp.get(s.charAt(i)) >= 0) {
                    cnt++;
                } else {
                    break;
                }
            }
            if (cnt == p.length())
                res.add(st);
        }
        
        return res;
    }
}