[4]560. Subarray Sum Equals K(Java)

注：此博客不再更新，所有最新文章将发表在个人独立博客limengting.site。分享技术，记录生活，欢迎大家关注

Given an array of integers and an integer k, you need to find the total number of continuous subarrays whose sum equals to k.

Example 1:

Input:nums = [1,1,1], k = 2
Output: 2

Note:
The length of the array is in range [1, 20,000].
The range of numbers in the array is [-1000, 1000] and the range of the integer k is [-1e7, 1e7].

thinking:
sum[i,j] = sum[0,j]-sum[0,i-1]
k = sum - sum[0,i-1]
sum[0,i-1] = k - sum
对于每一个sum来说，前面的子序列中有多少个k-sum结果中就可以构成多少个sum[i,j].

class Solution {
    public int subarraySum(int[] nums, int k) {
        int res = 0, sum = 0;
        Map<Integer, Integer> preSum = new HashMap<>();
        preSum.put(0,1); // [0, sum - k] is empty
        for (int j = 0;  j < nums.length; j ++) {
            sum += nums[j];
            if (preSum.containsKey(sum - k)) 
                res += preSum.get(sum - k);
            preSum.put(sum, preSum.getOrDefault(sum, 0) + 1);
        }
        return res;
    }
}