- 需要记录在0 ~ i点(包括nums[i], 以nums[i]结尾)的sum, 坐标型动态规划. 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 ...

[LC581](https://leetcode.com/problems/shortest-unsorted-continuous-subarray/description/) Given an integer array, you need to find one continuous subarray that if you ...