【模板总结】滑动窗口一类问题

最新推荐文章于 2024-08-28 20:58:28 发布

bijian0530

最新推荐文章于 2024-08-28 20:58:28 发布

阅读量119

点赞数

文章标签： java 数据结构算法

本文链接：https://blog.csdn.net/bijian0530/article/details/125812725

版权

1 滑动窗口大小不变

567. 字符串的排列

在这里插入图片描述

   public boolean checkInclusion(String s1, String s2) {
      char[] str1 = s1.toCharArray();
      int m = s1.length();
      char[] str2 = s2.toCharArray();
      if(s1.length() > s2.length()){
         return false;
      }
      int[] arr1 = new int[26];
      int[] arr2 = new int[26];
      for (int i = 0; i < str1.length; i++) {
         arr1[str1[i] - 'a']++;
         arr2[str2[i] - 'a']++;
      }
      if(judge(arr1, arr2)){
         return true;
      }
      for (int i = m; i < s2.length(); i++) {
         arr2[str2[i - m] - 'a']--;
         arr2[str2[i] - 'a']++;
         if(judge(arr1, arr2)){
            return true;
         }
      }
      return false;
   }
   private boolean judge(int[] arr1, int[] arr2) {
      for (int i = 0; i < 26; i++) {
         if(arr1[i] != arr2[i]){
            return false;
         }
      }
      return true;
   }

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

在这里插入图片描述

   public List<Integer> findAnagrams(String s, String p) {
      List<Integer> res = new ArrayList<>();
      char[] str1 = s.toCharArray();
      char[] str2 = p.toCharArray();
      if(str1.length < str2.length){
         return res;
      }
      int m = p.length();
      int[] arr1 = new int[26];
      int[] arr2 = new int[26];
      for (int i = 0; i < str2.length; i++) {
         arr2[str2[i] - 'a']++;
         arr1[str1[i] - 'a']++;
      }
      if(judge(arr1, arr2)){
         res.add(0);
      }
      for (int i = m; i < str1.length; i++) {
         arr1[str1[i - m] - 'a']--;
         arr1[str1[i] - 'a']++;
         if(judge(arr1, arr2)){
             res.add(i - m + 1);
         }
      }
      return res;
   }
   private boolean judge(int[] arr1, int[] arr2) {
      for (int i = 0; i < 26; i++) {
         if(arr1[i] != arr2[i]){
            return false;
         }
      }
      return true;
   }

2 滑动窗口大小会改变

76. 最小覆盖子串

在这里插入图片描述

   public String minWindow(String s, String t) {
      char[] str1 = s.toCharArray();
      char[] str2 = t.toCharArray();
      int N1 = s.length();
      int N2 = t.length();
      int[] res = new int[2];
      Map<Character, Integer> map = new HashMap<>();
      int left = 0;
      int right = 0;
      int count = str2.length;
      int windowLen = Integer.MAX_VALUE;
      for (int i = 0; i < str2.length; i++) {
         map.put(str2[i], map.getOrDefault(str2[i], 0) + 1);
      }  
      while(right < N1){
         if(map.containsKey(str1[right])){
            if(map.get(str1[right]) > 0){
               count--;
            }
            map.put(str1[right], map.get(str1[right]) - 1);
         }
         while(count == 0){
            if(windowLen > right - left){
               windowLen = right - left;
               res[0] = left;
               res[1] = right;
            }
            if(map.containsKey(str1[left])){
               map.put(str1[left], map.get(str1[left]) + 1);
               if(map.get(str1[left]) > 0){
                  count++;
               }
            }
            left++;
         }
         right++;
      }
      if(windowLen == Integer.MAX_VALUE){
         return "";
      }
      return s.substring(res[0], res[1] + 1);
   }

面试题 17.18. 最短超串

在这里插入图片描述

   public int[] shortestSeq(int[] big, int[] small) {
      int left = 0;
      int right = 0;
      int N = big.length;
      int[] res = {};
      int count = small.length;
      int minLen = N;
      Map<Integer, Integer> map = new HashMap<>();
      for (int i = 0; i < small.length; i++) {
         map.put(small[i], 1);
      }
      while (right < N) {
         if (map.containsKey(big[right])) {
            if (map.get(big[right]) > 0) {
               count--;
            }
            map.put(big[right], map.get(big[right]) - 1);
         }
         while (count == 0) {
            if(minLen > right - left){
               minLen = right - left;
               res = new int[]{left, right};
            }
            if(map.containsKey(big[left])){
               map.put(big[left], map.get(big[left]) + 1);
               if(map.get(big[left]) > 0){
                  count++;
               }
            }
            left++;
         }
         right++;
      }
      return res;
   }