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

思路：

1. 双指针
2. 直接依次判断当前窗口的哈希表是否和p的哈希表相同。

代码

1. 双指针：

class Solution {
public:
    vector<int> findAnagrams(string s, string p) {
        int left = 0;
        int right = 0;
        vector<int> res, mp(256, 0);
        for (char c: p) mp[c]++;
        int count = p.size();
        while(right < s.size()) {
            if (mp[s[right++]]-- >= 1) count--;
            if (count == 0) res.push_back(left);
            if (right-left == p.size() && mp[s[left++]]++ >= 0) count++;
        }
        return res;
    }
};

2. 哈希表：

class Solution {
public:
    vector<int> findAnagrams(string s, string p) {
        int left = 0, right = 0;
        vector<int> smp(256, 0), pmp(256, 0);
        
        for (char c: p) pmp[c]++;
        vector<int> res;
        
        while(right < s.size()) {
            smp[s[right++]]++;
            if (smp == pmp && right - left == p.size()) {
                res.push_back(left);
            }
            if (right - left >= p.size()) {
                smp[s[left++]]--;
            }
        }
        return res;
    }
};

为啥我觉得这个题这么绕啊。