560. 和为K的子数组 

 1 class Solution 
 2 {
 3 public:
 4     int subarraySum(vector<int>& nums, int k) 
 5     {
 6         unordered_map<int,int> hash;
 7         hash[0] = 1;
 8 
 9         int res = 0;
10         for(int i = 0,sum = 0;i < nums.size();i ++)
11         {
12             sum += nums[i];
13             res += hash[sum - k];
14             hash[sum]++;
15         }
16 
17         return res;
18     }
19 };

 

posted @ 2020-04-09 19:15  Jinxiaobo0509  阅读(119)  评论(0)    收藏  举报