class Solution {
public:
bool checkSubarraySum(vector<int>& nums, int k) {
int len = nums.size();
vector<int> sum(len+5);
for(int i= 1;i<=len;i++)
sum[i] = sum[i-1] + nums[i-1];
for(int i=0;i<len-1;i++)
for(int j=i+2;j<=len;j++){
if(k==0){
if(sum[j]-sum[i]==0)
return true;
}
else{
if((sum[j]-sum[i])%k==0)
return true;
}
}
return false;
}
};
Leetcode 523. Continuous Subarray Sum
最新推荐文章于 2020-11-23 23:35:13 发布