算法W17——Continuous Subarray Sum

题目：523. Continuous Subarray Sum

连接：https://leetcode.com/problems/continuous-subarray-sum/#/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.

解题思路：

这题是在动态规划里面找到的一条题目。题目要求找出是否有子串的和是k的倍数，若有则返回true。最简单的办法是找出所有子串并且求和，但是肯定超时。最终通过是用了一种最简单的动归思想，每次保留前一次计算的sum再加上当前的数字，算出新的sum保存下来，如果这个sum可以整除k，即可返回true。通过是通过了但是效率依然不高。本题另一个陷阱是空间越界，声明保存sum的数组用一维就够了，二维会越界。

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