560. Subarray Sum Equals K

560. Subarray Sum Equals K

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].
3. 
   

class Solution {
public:
    int subarraySum(vector<int>& nums, int k) {
        int sum = 0, result = 0;
        unordered_map<int, int> map;
        map[0] = 1;
        for (int i = 0; i < nums.size(); i++) {
            sum += nums[i];
            if (map.count(sum - k)) {
                result += map[sum - k];
            }
            if (map.count(sum)) {
                map[sum]++;
            }
            else {
                map[sum] =  1;
            }
        }
        return result;
    }
};

这个题和two sum的思想是相似的，没有做出来，应该好好思考一下