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].
分析:原本我的思路是两个指针从头跑到尾,但是在网上看到了一个更好的思路。做法是:维护一个HashMap, 在数组遍历时,这个HashMap的Key每次都记录着从数组起始位置到当前位置的和,这样用Key值-k的差如果在HashMap出现过,就说明这个差是=k的。此外要记录前面出现的次数,不能出现了就单纯+1。
class Solution {
public int subarraySum(int[] nums, int k) {
int count = 0 , presum = 0;
HashMap<Integer,Integer> map = new HashMap<>();
map.put(0,1);
for(int num:nums){
presum += num;
if(map.containsKey(presum-k)){
count += map.get(presum-k);
}
map.put(presum,map.getOrDefault(presum,0)+1);
}
return count;
}
}