523-Continuous Subarray Sum

类别：dynamic programming

难度：medium

题目描述

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.

算法分析

（1）首先，对数字进行累加运算

（2）因为对于两个数字，如果%k得到相同的余数，那么两者之差为k的整数倍

（3）由于需要用到除以k的操作，所以需要对k=0的情况做特别的处理（只要有两个相邻的0（或者以上）即可）

（4）这个算法的关键点是：a[i]+a[i+1]+....a[j] = S[j] - S[i - 1]

（5）判断是否满足条件，除了判断余数是否相同之外，还需要判断之间相邻的数目是否大于等于2

（6）用到了map的find操作，存储的是具有余数x的累加数的下标

代码实现

class Solution {
public:
    bool checkSubarraySum(vector<int>& nums, int k) {
        int n = nums.size();
        int sum = 0;
        if (n < 2) return false;
        //  因为后面用到取余操作，所以需要都除数为0的情况特殊考虑 
        if (k == 0) {
        	for (int i = 1; i < n; ++i) {
        		if (nums[i] == 0 && nums[i - 1] == 0) return true;
			}
			return false;
		}
        for (int i = 1; i < n; ++i) {
        	nums[i] += nums[i - 1];
            if (nums[i] % k == 0 && i != 0) return true;
		}
		map<int, int> remain;
		for (int i =  0; i < n; ++i) {
            // 两个数字如果除以k有同样的余数，说明两者之差为k的整数倍
			if (remain.find(nums[i] % k) == remain.end()) {
				remain[nums[i] % k] == i;
			} else {
				if (i - remain[nums[i] % k] > 1) return true;
			}
		}
	   return false;
    }
};