Math-523-Continuous Subarray Sum

最新推荐文章于 2024-09-22 20:09:34 发布

kevin聪

最新推荐文章于 2024-09-22 20:09:34 发布

阅读量287

点赞数 1

分类专栏：算法与数据结构 leetcode 文章标签：算法数据结构 leetcode

本文链接：https://blog.csdn.net/LaputaFallen/article/details/79222388

版权

算法与数据结构同时被 2 个专栏收录

569 篇文章 0 订阅

订阅专栏

leetcode

557 篇文章 12 订阅

订阅专栏

Description:
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 n*k where n is also an integer.

Example 1:

Input: [23, 2, 4, 6, 7],  k=6
Output: True
Explanation: Because [2, 4] is a continuous subarray of size 2 and sums up to 6.

Example 2:

Input: [23, 2, 6, 4, 7],  k=6
Output: True
Explanation: Because [23, 2, 6, 4, 7] is an continuous subarray of size 5 and sums up to 42.

Note:
The length of the array won’t exceed 10,000.
You may assume the sum of all the numbers is in the range of a signed 32-bit integer.

Best Solution:

//还是举例子理解,[23,2,4,6,7],k = 6.在23处sum % 6 = 5,在4处sum % 4 = 5,说明23到4之间(不包含23)的元素之和为k的倍数。因此问题就变成了维护一个sum和map，map存储对应sum的下标，若key已存在且下标之差>1返回true
class Solution {
   public boolean checkSubarraySum(int[] nums, int k) {
      if (nums == null || nums.length == 0) return false;
     Map<Integer, Integer> map = new HashMap<>();
     map.put(0, -1);
     int sum = 0;
       for (int i = 0; i < nums.length; i++) {
           sum += nums[i];
           if (k != 0) sum %= k;
           if (map.get(sum) != null && i - map.get(sum) > 1) return true;
           if (map.get(sum) != null) continue;
           map.put(sum, i);
       }
       return false;
}
}