leetcode - 438. Find All Anagrams in a String

Description

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.

An Anagram is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the original letters exactly once.

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

Constraints:

复制代码
1 <= s.length, p.length <= 3 * 10^4
s and p consist of lowercase English letters.

Solution

Sliding window, use a hash table to keep track of all the characters we have already visited. If all the characters are visited, then we get our answer.

Time complexity: o ( n ) o(n) o(n)

Space complexity: o ( n ) o(n) o(n)

Code

python3 复制代码
class Solution:
    def findAnagrams(self, s: str, p: str) -> List[int]:
        available_chars = {}
        for c in p:
            available_chars[c] = available_chars.get(c, 0) + 1
        distinct_chars = len(available_chars)
        left = -1
        res = []
        cur_chars = available_chars.copy()
        for right in range(len(s)):
            if s[right] not in available_chars:
                left = right
                cur_chars = available_chars.copy()
            else:
                while cur_chars[s[right]] <= 0:
                    left += 1
                    cur_chars[s[left]] += 1
                cur_chars[s[right]] -= 1
            if list(cur_chars.values()) == [0] * distinct_chars:
                res.append(left + 1)
        return res

Other method sliding window

python3 复制代码
class Solution:
    def findAnagrams(self, s: str, p: str) -> List[int]:
        p_chars = {}
        for c in p:
            p_chars[c] = p_chars.get(c, 0) + 1
        s_chars = {}
        left = -1
        res = []
        for right in range(len(s)):
            s_chars[s[right]] = s_chars.get(s[right], 0) + 1
            while len(s_chars) > len(p_chars) or s_chars.get(s[right], 0) > p_chars.get(s[right], 0):
                left += 1
                s_chars[s[left]] -= 1
                if s_chars[s[left]] == 0:
                    s_chars.pop(s[left])
            if s_chars == p_chars:
                res.append(left + 1)
        return res
相关推荐
纪元A梦7 分钟前
贪心算法应用:信用评分分箱问题详解
java·算法·贪心算法
大飞pkz22 分钟前
【设计模式】题目小练2
开发语言·设计模式·c#·题目小练
过河卒_zh15667661 小时前
9.13AI简报丨哈佛医学院开源AI模型,Genspark推出AI浏览器
人工智能·算法·microsoft·aigc·算法备案·生成合成类算法备案
D.....l1 小时前
冒泡排序与选择排序以及单链表与双链表
数据结构·算法·排序算法
sinat_286945192 小时前
Case-Based Reasoning用于RAG
人工智能·算法·chatgpt
Athenaand2 小时前
代码随想录算法训练营第50天 | 图论理论基础、深搜理论基础、98. 所有可达路径、广搜理论基础
算法·图论
地平线开发者2 小时前
征程 6 灰度图部署链路介绍
人工智能·算法·自动驾驶·汽车
csdn_aspnet2 小时前
MongoDB C# .NetCore 驱动程序 序列化忽略属性
mongodb·c#·.netcore