- 需要记录在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 ...
# Given an integer array nums, you need to find one continuous subarray such that # if you only sort this subarray in non-decreasing order, then the whole array will # be sorted in non-decreasing ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results