[Leetcode] 523. Continuous Subarray Sum
Problems: https://leetcode.com/problems/continuous-subarray-sum/Solution1:利用sum存储到第 i 位的sum注意计算diff时subarray长度至少为2class Solution { public boolean checkSubarraySum(int[] nums, int k) { ...
原创
2019-10-06 23:25:03 ·
91 阅读 ·
0 评论