class Solution {
public:
int subarraySum(vector<int>& nums, int k) {
unordered_map<int,int> hash;
hash[0]=1;
int sum=0;
int res=0;
for(int num:nums) {
sum+=num;
res+=hash[sum-k];
hash[sum]++;
}
return res;
}
};
Leetcode560(力扣560):和为K的子数组
最新推荐文章于 2024-07-10 15:40:18 发布