iframe-proxy | Sunbelt Computer Software

50 lines (49 loc) · 1.73 KB

package code;
 * 438. Find All Anagrams in a String
 * 题意：匹配相同字符组成的串
 * 分类：Hash Table
 * 思路：滑动窗口，O(n)时间
 * Tips：滑动窗口解法 https://leetcode.com/problems/find-all-anagrams-in-a-string/discuss/92007/Sliding-Window-algorithm-template-to-solve-all-the-Leetcode-substring-search-problem
import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
public class lc438 {
    public static void main(String[] args) {
        System.out.println(findAnagrams("cbaebabacd", "abc"));
    public static List<Integer> findAnagrams(String s, String p) {
        List<Integer> ls = new ArrayList<>();
        if(s.length()<p.length())
            return ls;
        HashMap<Character, Integer> hm = new HashMap();
        for (int i = 0; i < p.length() ; i++) {
            hm.put(p.charAt(i), hm.getOrDefault(p.charAt(i), 0)+1);
        int right = 0, left = 0, count = 0;
        while(right<s.length()){
            char ch_r = s.charAt(right);
            char ch_l = s.charAt(left);
            if(hm.containsKey(ch_r)){
                hm.put(ch_r, hm.getOrDefault(ch_r,0)-1);
                if(hm.get(ch_r)>=0) //注意count++的条件，多余的相同字符不用++了
                    count++;
            if(count==p.length())
                ls.add(left);
            if(right-left+1==p.length()){   //左指针需要右移
                if(hm.containsKey(ch_l)){
                    hm.put(ch_l, hm.get(ch_l)+1);
                    if(hm.get(ch_l)>0)  //count--的条件
                        count--;
                left++;
            right++;
        return ls;

Sunbelt Computer Software

PL/B Language Development and Support

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

Sunbelt Computer Software

PL/B Language Development and Support

Uh oh!

FilesExpand file tree

lc438.java

Latest commit

History

lc438.java

File metadata and controls