LeetCode560. 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

Constraints:

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

题意

在数组中找符合和为K的连续子数组。（一开始以为是最小）

思路

①简单枚举，空间复杂度低。从头开始向前枚举即可。
②前缀优化，可以利用哈希进行前缀优化，对前缀已经求和过的值不再进行求和以此来减小时间复杂度。

题解

class Solution {
public:
    int subarraySum(vector<int>& nums, int k) {
       unordered_map<int,int> numTimes;
       numTimes[0]=1;
       int count=0;
       int pre=0,begin=0;
       for(auto &n:nums){
            pre+=n;
            if(numTimes.find(pre-k)!=numTimes.end()){
                count+=numTimes[pre-k];
            }
            numTimes[pre]++;
       }
       return count;
    }
};