Given a list of non-negative numbers and a target integer k, write a function to check if the array has a continuous subarray of size at least 2 that sums up to the multiple of k, that is, sums up to n*k where n is also an integer.
Example 1:
Input: [23, 2, 4, 6, 7], k=6 Output: True Explanation: Because [2, 4] is a continuous subarray of size 2 and sums up to 6.
Example 2:
Input: [23, 2, 6, 4, 7], k=6 Output: True Explanation: Because [23, 2, 6, 4, 7] is an continuous subarray of size 5 and sums up to 42.
Note:
- The length of the array won't exceed 10,000.
- You may assume the sum of all the numbers is in the range of a signed 32-bit integer.
这道题是判断数组中是否有长度至少为2且相加和是k的倍数的子数组,题目难度为Medium。
比较直观的想法是从长度2开始依次计算所有子数组的相加和,判断其是否是k的倍数。这里不必每轮循环都重新计算相加和,可以通过动态规划的思想在上一轮循环的基础上再加一个数组元素来计算当前循环中的相加和。题目的边界情况比较多,需要注意以下几点:
-
子数组长度至少为2;
-
k可能为0;
-
n可能为0;
具体代码:
class Solution {
public:
bool checkSubarraySum(vector<int>& nums, int k) {
int sz = nums.size();
vector<int> sum(nums.begin(), nums.end());
for(int len=2; len<=sz; ++len) {
for(int i=0; i<=sz-len; ++i) {
sum[i] += nums[i+len-1];
if(sum[i] == 0) return true;
else if(k != 0 && sum[i]%k == 0) return true;
}
}
return false;
}
};
看了下别人的代码,分享给大家一种新的方法,时间和空间复杂度上都比动态规划的方法优秀很多。遍历整个数组,依次加当前数组元素并将相加和求余k,求余结果只有0~k-1这k中情况,将求余结果存入Hash Table中。如果遍历到当前位置求余结果已经在Hash Table中,表明从上一求余结果相同的位置到当前位置的子数组相加和是k的倍数,否则将求余结果存入Hash Table。这里同样需要注意上面提到的边界情况,代码中hash[0] = -1这行即为了便于边界情况的处理。具体代码:
class Solution {
public:
bool checkSubarraySum(vector<int>& nums, int k) {
unordered_map<int, int> hash;
int sum = 0;
hash[0] = -1;
for(int i=0; i<nums.size(); ++i) {
sum += nums[i];
if(k) sum %= k;
if(hash.find(sum) != hash.end()) {
if(i-hash[sum] > 1) return true;
}
else hash[sum] = i;
}
return false;
}
};