LeetCode 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.
解题思路：
答案很简单，只需用两个for循环列出所有组合的总和再判断是否能被k整除，关键在于一些特殊情况的处理：
1.当数组元素个数小于2时，返回false
2.当k=0且nums的总和不为0时返回false;
3.当k=0且nums的每个元素都为0时返回true;

class Solution {
public:
    bool checkSubarraySum(vector<int>& nums, int k) {
        if(nums.size() < 2) return false;
        if(k==0 && !accumulate(nums.begin(),nums.end(),0)) return true;
        if(k==0 && accumulate(nums.begin(),nums.end(),0)) return false;
        int sum = 0,num=0;
        bool flag = 0;
        for(int i = 0; i != nums.size(); ++i){
            sum = 0;
            num = 0;
            for(int j = i; j != nums.size(); ++j){
                sum += nums[j];
                ++num;
                if(sum % k == 0 && num >= 2){
                    return true;
                }
            }
        }
        return false;
    }
};