leetcode滑动窗口总结

力扣滑动窗口总结(438 76 567)

下述三题均用labuladong滑动窗口的代码框架:这是java版本

滑动窗口的代码框架思路分析:

1. 建立两个字典,need和windows needs里面放需要进行匹配的字符串 windows做动态的滑动窗口,同时还可以记录有效值
2. valid就是看need里面有几个字符串进行了匹配
3. 当right < s.length的时候 right++
4. 判断need里面是否存在这个字符,如果有 窗口里面也进行添加,在判但window里面的这个字符的数量和need里面的字符数量是不是一直的如果是一致的,则valid++
5. 循环,判断左窗口是不是需要移动,如果需要移动,去找需要截取字符串的左值和右值(其实这里是动态进行那个判定的,不一定是需要匹配的字符) 找索引,并进行存储
6. 判断need是不是有left对应的字符,need里面有,windows里面肯定也有,left已经进行了++ 看windows中left对应的字符数和need对应的字符数是不是相同,若相同 valid - 1 此时window中left对应字符的有效数字 - 1

**第438题:**找到字符串中所有的异位词

class Solution {
    public List<Integer> findAnagrams(String s, String p) {
        ArrayList<Integer> list = new ArrayList<>();
        HashMap<Character, Integer> needs = new HashMap<>();
        HashMap<Character, Integer> windows = new HashMap<>();

        char[] sArr = s.toCharArray();
        char[] pArr = p.toCharArray();

        int left = 0,right = 0,valid = 0;

        for (char c : pArr) {
            needs.put(c,needs.getOrDefault(c,0) + 1);
        }

        while (right < sArr.length) {
            char c = sArr[right];
            right++;

            if (needs.containsKey(c)) {
                windows.put(c,windows.getOrDefault(c,0) + 1);
                if (windows.get(c).equals(needs.get(c))) {
                    valid++;
                }
            }

            while (right - left >= pArr.length) {
              if(valid == needs.size()){
                  list.add(left);
              }

                char d = sArr[left];
                left++;

                if (needs.containsKey(d)){
                    if (windows.get(d).equals(needs.get(d))){
                        valid--;
                    }
                    windows.put(d,windows.get(d) - 1);
                }
            }
        }
        
        return list;
    }
}

第76题

class Solution {
    public String minWindow(String s, String t) {
            //再把这个题重新做一遍
        char[] sArr = s.toCharArray();
        char[] tArr = t.toCharArray();
        HashMap<Character, Integer> need = new HashMap<>();
        HashMap<Character, Integer> windows = new HashMap<>();
        //这里把字符串存进去
        for (char c :tArr) {
            need.put(c,need.getOrDefault(c,0) + 1);
        }

        int left = 0;
        int right = 0;
        int valid = 0;
        int start = 0;
        int len = Integer.MAX_VALUE;


        while (right < sArr.length) {
            char c = sArr[right];
            right++;

            if (need.containsKey(c)) {
                windows.put(c,windows.getOrDefault(c,0)+ 1);
                if (need.get(c).equals(windows.get(c))) {
                    valid++;
                }
            }

            //这里判断是否可以滑动左边的窗口
            while (valid == need.size()) {
                if (right - left < len) {
                    start = left;
                    len = right - left;
                }

                char d = sArr[left];
                left++;
                if (need.containsKey(d)) {
                    if (windows.get(d).equals(need.get(d))) {
                        valid--;//这个小东西其实就是控制这个循环的条件,这样进行控制,其实还是很有意思的
                    }

                    windows.put(d,windows.get(d) - 1);
                }

            }
        }
        
        return len == Integer.MAX_VALUE ? "" : s.substring(start,start + len);
    }
}

第567:字符串的排列

class Solution {
    public boolean checkInclusion(String s1, String s2) {
        char[] s1Arr = s1.toCharArray();
        char[] s2Arr = s2.toCharArray();
        HashMap<Character, Integer> needs = new HashMap<>();
        HashMap<Character, Integer> windows = new HashMap<>();

        for (char c :s1Arr) {
            needs.put(c,needs.getOrDefault(c,0) + 1);
        }
        
        int left = 0,right = 0,valid = 0;

        while (right < s2Arr.length) {
            char c = s2Arr[right];
            right++;

            if (needs.containsKey(c)) {
                windows.put(c,windows.getOrDefault(c,0) + 1);
                if (windows.get(c).equals(needs.get(c))) {
                    valid++;
                }
            }
            
            //这里判断是否需要移动左边的值
            while (right - left >= s1Arr.length) {
                if (valid == needs.size()) {
                    return true;
                }
                
                char d = s2Arr[left];
                left++;

                if (needs.containsKey(d)) {
                    if (windows.get(d).equals(needs.get(d))) {
                        valid--;
                    }
                    windows.put(d,windows.get(d) - 1);
                }
            }
        }
        
        return false;
    }
}