【模板总结】前缀和总结

bijian0530

已于 2022-07-15 21:47:52 修改

阅读量82

点赞数

文章标签：算法 leetcode java

于 2022-07-15 21:45:10 首次发布

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

版权

525. 连续数组

在这里插入图片描述

   public int findMaxLength(int[] nums) {
      int[] sumArr = new int[nums.length];
      int N = nums.length;
      int sum = 0;
      for (int i = 0; i < N; i++) {
         if (nums[i] == 1) {
            sum++;
            sumArr[i] = sum;
         } else if (nums[i] == 0) {
            sum--;
            sumArr[i] = sum;
         }
      }
      int left = 0;
      int max = 0;
      Map<Integer, Integer> map = new HashMap<>();
      map.put(0, -1);
      for (int i = 0; i < N; i++) {
         if(map.containsKey(sumArr[i])){
            if(max < i - map.get(sumArr[i])){
               max = i - map.get(sumArr[i]);
            }
         }else {
            map.put(sumArr[i], i);
         }
      }
      return max;
   }

523. 连续的子数组和

在这里插入图片描述

   public boolean checkSubarraySum(int[] nums, int k) {
      Map<Integer, Integer> map = new HashMap<>();
      map.put(0, - 1);
      int preSum = 0;
      for (int i = 0; i < nums.length; i++) {
         preSum += nums[i];
         int key = k == 0 ? preSum : preSum % k;
         if(map.containsKey(key)){
            if(i - map.get(key) >= 2){
               return true;
            }
         }else{
            map.put(key, i);
         }
      }
      return false;
   }

面试题 17.05. 字母与数字

在这里插入图片描述

   public String[] findLongestSubarray(String[] array) {
      int N = array.length;
      int[] sumArr = new int[N];
      int sum = 0;
      int left = 0;
      int right = 0;
      for (int i = 0; i < array.length; i++) {
         if (Character.isDigit(array[i].charAt(0))) {
            sum--;
            sumArr[i] = sum;
         } else {
            sum++;
            sumArr[i] = sum;
         }
      }
      Map<Integer, Integer> map = new HashMap<>();
      map.put(0, -1);
      int max = 0;
      for (int i = 0; i < N; i++) {
         if (map.containsKey(sumArr[i])) {
            if (max < i - map.get(sumArr[i])) {
               max = i - map.get(sumArr[i]);
               left = map.get(sumArr[i]);
               right = i;
            }
         } else {
            map.put(sumArr[i], i);
         }
      }
      String[] ans = new String[right - left];
      int index = 0;
      for (int i = left + 1; i <= right; i++) {
         ans[index] = array[i];
         index++;
      }
      return ans;
   }

560. 和为 K 的子数组

在这里插入图片描述

   public int subarraySum(int[] nums, int k) {
      if(nums == null || nums.length == 0){
         return 0;
      }
      Map<Integer,Integer> map = new HashMap<>();
      map.put(0, 1);
      int preSum = 0;
      int count = 0;
      for (int i = 0; i < nums.length; i++) {
         preSum += nums[i];
         if(map.containsKey(preSum - k)){
            count = count + map.get(preSum - k);
         } 
         map.put(preSum, map.getOrDefault(preSum,0) + 1);
      }
      return count;
   }