题目链接:https://leetcode-cn.com/problems/continuous-subarray-sum/
我以为的动态规划:dp
这道题的动态规划:前缀和
前缀和的复杂度是O(n^2),能AC,但是可以再简化
从前向后遍历,记录到当前位置前缀和模k的余数及其下标,若该余数在当前下标之前出现过,则说明这二者之间的子数组满足条件。
代码如下:
class Solution {
public:
bool checkSubarraySum(vector<int>& nums, int k) {
int sum = 0;
map<int, int> mp;
mp[0] = 1;
for(int i = 0; i < nums.size(); i++) {
sum += nums[i];
if(k != 0) {
sum = sum % k;
}
printf("sum = %d, mp[sum] = %d\n", sum, mp[sum]);
if(mp[sum] != 0) {
if(i + 2 - mp[sum] > 1) {
return true;
}
} else {
mp[sum] = i + 2;
}
printf("sum = %d, mp[sum] = %d\n\n", sum, mp[sum]);
}
return false;
}
};