leetcode--523. Continuous Subarray Sum

Question: 

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.

Note:

1. The length of the array won't exceed 10,000.
   
   
2. You may assume the sum of all the numbers is in the range of a signed 32-bit integer.

解决思路：由于只需要判断存不存在的问题，而不需要求出size的大小，问题简便很多。这相当于在nums中找到一个size大于2的子序列，是的其中的元素的和是k的n倍（n为整数）。先考虑k是否为0的情况。①为零时：只要nums终有连续的元素为0则输出true否则为false；②其不为零时，就在从nums的第i = 1个元素开始往后面相加，加一次就判断一次是否可以整除k，只要有一次可以整除k则返回true。一次循环结束后如果还没有答案，则从头再来，将sum count都初始为0，而且把刚开始相加的i++；也就是往后进一位。重复循环。直到nums中所有子序列都遍历一边。（sum指的是和，  count指的是子序列的size大小）

代码实现部分：

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