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.

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: dynamic programming

易错点

1. 丧心病狂的corner cases：

class Solution1 {
public:
    bool checkSubarraySum(vector<int>& nums, int k) {
        unordered_map<int, int> hash ={{0, -1}};
        int sum = 0;
        for (int i = 0; i < nums.size(); i++) {
                sum += nums[i];
                int tmp = (k == 0) ? sum : (sum % k);
                if (hash.count(tmp) && (hash[tmp] != i - 1 )) return true;
                if (!hash.count(tmp)) hash[tmp] = i;
        }
        return false;
    }
};