一个模板让滑动窗口算法变成了默写题-CSDN博客

本文链接：https://blog.csdn.net/qq_41080854/article/details/130558720

文章介绍了滑动窗口算法在解决字符串相关问题中的应用，如寻找无重复字符的最长子串、最小覆盖子串、字母异位词和字符串排列检查。这些题目均利用了滑动窗口的思想，通过维护一个固定大小的窗口在字符串中移动，用哈希映射存储窗口内字符出现的次数，从而达到高效求解的目的。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

文档阅读

文档阅读
滑动窗口算法的时间复杂度是 O(N),指针 left, right不会回退（它们的值只增不减），所以字符串/数组中的每个元素都只会进入窗口一次，然后被移出窗口一次

左闭右开模板

public void slidingWindow(String s, String t) {
    Map<Character, Integer> need = new HashMap<>();
    Map<Character, Integer> window = new HashMap<>();
    for (char c : t.toCharArray()) {
        need.put(c, need.getOrDefault(c, 0) + 1);
    }

    int left = 0, right = 0, valid = 0;
    while (right < s.length()) {
        char c = s.charAt(right);
        right++;

        // 进行窗口内数据的一系列更新
        if (need.containsKey(c)) {
       	    window.put(c, window.getOrDefault(c, 0) + 1);
       	    if(window.get(c).equals(need.get(c)))){
				valid++;
			}
        }
        
		//debug
        System.out.format("window: [%d, %d)\n", left, right);
        
        // 判断左侧窗口是否要收缩
        while (收缩条件) {
            // 判断是否找到了合法的子串
            if (合法的子串条件) {
                // 更新结果
                ...
            }

            char d = s.charAt(left);
            left++;

            // 进行窗口内数据的一系列更新
            if (need.containsKey(d)) {
	       	    if(window.get(d).equals(need.get(d)))){
					valid--;
				}
				window.put(d, window.get(d) - 1);
	        }
        }
    }
}

题目

3. 无重复字符的最长子串

class Solution {
    public int lengthOfLongestSubstring(String s) {
        int left = 0, right = 0, res = 0;
        HashMap<Character, Integer> window = new HashMap<>();
        while(right < s.length()){
            char c = s.charAt(right);
            right++;
            window.put(c, window.getOrDefault(c, 0) + 1);
            while(window.get(c) > 1){
                char d = s.charAt(left);
                left++;
                window.put(d, window.get(d) - 1);
            }
            res = Math.max(res, right - left);   
        }
        return res;
    }
}

76. 最小覆盖子串

class Solution {
    public String minWindow(String s, String t) {
        int start = 0, length = Integer.MAX_VALUE;
        int left = 0, right = 0, valid = 0;
        HashMap<Character, Integer> window = new HashMap<>();
        HashMap<Character, Integer> need = new HashMap<>();
        for(char c : t.toCharArray()){
            need.put(c, need.getOrDefault(c, 0) + 1);
        }
        while(right < s.length()){
            char c = s.charAt(right);
            right++;
            if(need.containsKey(c)){
                window.put(c, window.getOrDefault(c, 0) + 1);
                if(window.get(c).equals(need.get(c))){
                    valid++;
                }
            }
            while(valid == need.size()){
                if(right - left < length){
                    length = right - left;
                    start = left;
                }
                char d = s.charAt(left);
                left++;
                if(need.containsKey(d)){
                    if(window.get(d).equals(need.get(d))){
                        valid--;
                    }
                    window.put(d, window.get(d) - 1);
                }
            }
        }
        return length == Integer.MAX_VALUE ? "" : s.substring(start, start + length);
    }
}

438. 找到字符串中所有字母异位词

class Solution {
    public List<Integer> findAnagrams(String s, String p) {
        List<Integer> res = new ArrayList<>();
        HashMap<Character, Integer> window = new HashMap<>();
        HashMap<Character, Integer> need = new HashMap<>();
        int left = 0, right = 0, valid = 0;
        for(char c : p.toCharArray()){
            need.put(c, need.getOrDefault(c, 0) + 1);
        }
        while(right < s.length()){
            char c = s.charAt(right);
            right++;
            if(need.containsKey(c)){
                window.put(c, window.getOrDefault(c, 0) + 1);
                if(window.get(c).equals(need.get(c))){
                    valid++;
                }
            }
            while(right - left == p.length()){
                if(valid == need.size()){
                    res.add(left);
                }
                char d = s.charAt(left);
                left++;
                if(need.containsKey(d)){
                    if(window.get(d).equals(need.get(d))){
                        valid--;
                    }
                    window.put(d, window.get(d) - 1);
                }
            }
        }
        return res;
    }
}

567. 字符串的排列

class Solution {
    public boolean checkInclusion(String s1, String s2) {
        HashMap<Character, Integer> window = new HashMap<>();
        HashMap<Character, Integer> need = new HashMap<>();
        for(char c : s1.toCharArray()){
            need.put(c, need.getOrDefault(c, 0) +  1);
        }
        int left = 0, right = 0, valid = 0;
        while(right < s2.length()){
            char c = s2.charAt(right);
            right++;
            if(need.containsKey(c)){
                window.put(c, window.getOrDefault(c, 0) + 1);
                if(window.get(c).equals(need.get(c))) valid++;
            }
            while(right - left == s1.length()){
                if(valid == need.size()) return true;
                char d = s2.charAt(left);
                left++;
                if(need.containsKey(d)){
                    if(window.get(d).equals(need.get(d))) valid--;
                    window.put(d, window.get(d) - 1);
                }
            }
        }
        return false;
    }
}