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].
刷出来之后居然还洋洋自得觉得自己真厉害
后来发现我写了个o(n^2), 这和brute force有什么区别!!空间复杂度分明可以O(1), 但是我居然用到了O(n), Shame on me!!
class Solution {
public int subarraySum(int[] nums, int k) {
if (nums == null || nums.length == 0) return k == 0 ? 1 : 0;
int[] res = new int[nums.length];
if (nums[0] == k) res[0] = 1;
else res[0] = 0;
for(int i = 1; i < nums.length; i++){
int count = 0;
int sum = 0;
for(int j = i; j >= 0; j--){
sum += nums[j];
if (sum == k) count++;
}
res[i] = res[i-1] + count;
}
return res[nums.length - 1];
}
}
如果要优化到比较好的O(n)的思路。
自然要从空间复杂度下手,那必须要存储一些中间结果,那么就是中间结果该怎么保存的问题。
我是没想明白,答案是这么说的
Sum(i, j ) = Sum(0, j) - Sum(0, i-1)
哎,靠谱啊,再写一版吧。
改良版本
class Solution {
public int subarraySum(int[] nums, int k) {
if (nums == null || nums.length == 0) return k == 0 ? 1 : 0;
Map<Integer, Integer> map = new HashMap<>();
int sum = 0;
int count = 0;
map.put(0, 1);
for(int i = 0; i < nums.length; i++){
sum += nums[i];
count += map.getOrDefault(sum - k, 0);
map.put(sum, map.getOrDefault(sum, 0) + 1);
}
return count;
}
}
btw, 我煲的牛尾杂蔬汤可真好喝啊