# [LeetCode 523] Continuous Subarray Sum

[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 nk where n is also an *integer.

Example 1:

Example 2:

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.