Description
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.
分析
- 思路也比較直接,把所有的子數組都列舉出來然後判斷是否符合條件就行了,這裡需要用到兩個循環,第一個循環表示子數組的開始位置,第二個循環表示子數組的結束位置。
代碼
class Solution {
public:
bool checkSubarraySum(vector<int>& nums, int k) {
int sum=0;
for(int i=0;i<nums.size();i++){
sum=nums[i];
for(int j=i+1;j<nums.size();j++){
sum+=nums[j];
if(sum==k){
return true;
}
if(k!=0&&sum%k==0){
return true;
}
}
}
return false;
}
};