2020-12-13 560. Subarray Sum Equals K

560. Subarray Sum Equals K

Difficulty: Medium

Related Topics: Array, Hash Table

Given an array of integers nums and an integer k, return the total number of continuous subarrays whose sum equals to k.

Example 1:

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

Example 2:

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

Constraints:

• 1 <= nums.length <= 2 * 10<sup>4</sup>
• -1000 <= nums[i] <= 1000
• -10<sup>7</sup> <= k <= 10<sup>7</sup>

Solution

Key: This question makes use of a technique called prefix sum

This is similar to the thought of dynamic programming where looping only once through the array is enough to calculate the frequencies of the elements.

Language: Java

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