- 需要记录在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 ...

8 Course Schedule.java Medium Java [BFS, Backtracking, DFS, Graph, Topological Sort] 9 Course Schedule II.java Medium Java [BFS, DFS, Graph, Topological Sort] 10 Binary Tree Preorder Traversal.java ...