LeetCode-algorithms 523. Continuous Subarray Sum

题目：

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.

思考：

这道题用动态规划去做，从index为0开始往后遍历，暴力搜索每一个子串，下一个子串的和等于上一个子串的和加上当前遍历到的数字即可。需要注意的是这里的内存空间限制，当样本多的时候就不能使用2维德数组去进行动规，因此这里从不同index开始搜索时，我都用同一个sum数组，sum的长度为n，所以对后面的所有长度都够用。

代码：

class Solution {
public:
    bool checkSubarraySum(vector<int>& nums, int k) {
        int n = nums.size(),i = 1,j;
        vector<int> sum(n);
        for(i =0;i<n-1;i++){
            sum[0] = nums[i];
            for (j = 1;i+j<n;j++){
                sum[j] = sum[j-1]+nums[i+j];
                if((sum[j] == 0 && k == 0) ||(k != 0 && sum[j]%k==0)) return true;
            }
        }
        return false;
    }
};

结果：