LeetCode(22), Subarray Sum Equals K

Description

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:

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

Solution

Go through all the elements in the array. For every element in the array, calculate the cumulative sum of previous sum S[i], if we can find a S[j] where j < i such that S[j] = S[i] - k, then the subarray from [j+1, ..., i] is the demanded subarray.
We can use a hashMap whose key is the previous sum, value is the count for this previous sum, to achieve a quick O(1) search.
Thus, the time and space complexity for this solution is:
Time complexity: O(n)
Space complexity: O(n)

class Solution {
    public int subarraySum(int[] nums, int k) {
        int count = 0, sum = 0;
        Map<Integer, Integer> map = new HashMap<>();

        map.put(0, 1);

        for (int i = 0; i < nums.length; i++) {
            sum += nums[i];
            if (map.containsKey(sum - k)) {
                count += map.get(sum - k);
            }
            map.put(sum, map.getOrDefault(sum, 0) + 1);
        }
        return count;
    }
}