560.和为 K 的子数组

不决问春风

已于 2024-05-17 20:05:12 修改

阅读量138

点赞数 4

分类专栏：算法文章标签：算法 leetcode java

于 2024-05-11 19:15:06 首次发布

本文链接：https://blog.csdn.net/m0_63653444/article/details/138727090

版权

算法专栏收录该内容

12 篇文章 0 订阅

订阅专栏

写的测试代码：

package org.example;
import java.util.HashMap;

/**
 * @Author:wjy
 */
public class Test {
    public static void main(String[] args) {
        int[] arr = {1,1,1,1,-1,1,-1,4,-1};
        Solution a = new Solution();
        System.out.println(a.subarraySum(arr,3));
    }
}

class Solution {
    public int subarraySum(int[] nums, int k) {
        int res = 0;
        int len = nums.length;
        HashMap<Integer,Integer> map = new HashMap<>();
        int pre = 0;
        map.put(0,1);
        for(int i = 0; i < len; i++){
            int p = pre;
            pre += nums[i];
            System.out.println("pre = " + p + " + " + nums[i] + " = "+ pre);
            if(map.containsKey(pre-k)){
                res += map.get(pre-k);
                System.out.println("res = res + map.get(" +  (pre-k) +") = " + res);
            }
            map.put(pre,map.getOrDefault(pre,0)+1);
            System.out.println(map);
        }
        return res;
    }
}

pre = 0 + 1 = 1
{0=1, 1=1}
pre = 1 + 1 = 2
{0=1, 1=1, 2=1}
pre = 2 + 1 = 3
res = res + map.get(0) = 1
{0=1, 1=1, 2=1, 3=1}
pre = 3 + 1 = 4
res = res + map.get(1) = 2
{0=1, 1=1, 2=1, 3=1, 4=1}
pre = 4 + -1 = 3
res = res + map.get(0) = 3
{0=1, 1=1, 2=1, 3=2, 4=1}
pre = 3 + 1 = 4
res = res + map.get(1) = 4
{0=1, 1=1, 2=1, 3=2, 4=2}
pre = 4 + -1 = 3
res = res + map.get(0) = 5
{0=1, 1=1, 2=1, 3=3, 4=2}
pre = 3 + 4 = 7
res = res + map.get(4) = 7
{0=1, 1=1, 2=1, 3=3, 4=2, 7=1}
pre = 7 + -1 = 6
res = res + map.get(3) = 10
{0=1, 1=1, 2=1, 3=3, 4=2, 6=1, 7=1}
10

折腾了好久，总算搞明白过程了......