Leecode:Subarray Sum Equals K(JS解答)
思路:采用哈希表加前缀和的思路来解题
function subarraySum(nums: number[], k: number): number {
let mapobj:any = {};
let count = 0;
let temp = 0;
mapobj[0] = 1;
for(let i = 0; i < nums.length; i++){
temp += nums[i];
if(mapobj.hasOwnProperty(temp-k)){
count += mapobj[temp-k];
}
if(mapobj.hasOwnProperty(temp)){
mapobj[temp] += 1;
}else{
mapobj[temp] = 1;
}
}
return count;
};