523. Continuous Subarray Sum
来源:互联网 发布:网络主播怎么招聘 编辑:程序博客网 时间:2024/06/05 04:17
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=6Output: TrueExplanation: Because [2, 4] is a continuous subarray of size 2 and sums up to 6.
Example 2:
Input: [23, 2, 6, 4, 7], k=6Output: TrueExplanation: 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.
public class Solution { public boolean checkSubarraySum(int[] nums, int k) { HashMap<Integer, Integer> map = new HashMap<Integer, Integer>(); 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.containsKey(sum)) { if (i - map.get(sum) > 1) { return true; } } else { map.put(sum, i); } } return false; }}
0 0
- 523. Continuous Subarray Sum
- 523. Continuous Subarray Sum
- 523. Continuous Subarray Sum
- 523. Continuous Subarray Sum
- 523. Continuous Subarray Sum
- 523. Continuous Subarray Sum
- 523. Continuous Subarray Sum
- 523. Continuous Subarray Sum
- 523. Continuous Subarray Sum
- 523. Continuous Subarray Sum
- 523. Continuous Subarray Sum
- 523. Continuous Subarray Sum
- 523. Continuous Subarray Sum
- 523. Continuous Subarray Sum
- 523. Continuous Subarray Sum
- 523. Continuous Subarray Sum
- Leetcode-523. Continuous Subarray Sum
- Leetcode 523. Continuous Subarray Sum
- 解决fatal: No remote repository specified. Please, specify either a URL...
- 弹跳小球
- 报数游戏,滑动解锁,蓝桥
- 数据挖掘算法之贝叶斯网络
- c语言中全局变量在多个文件中使用
- 523. Continuous Subarray Sum
- Qt5--学习笔记-调用笔记本电脑摄像头
- 提取分块图片的特征
- 近200篇机器学习&深度学习资料分享(含各种文档,视频,源码等)
- Android studio修改项目名
- 廖雪峰老师——Python入门(Python变量和数据类型 )
- 写给软件学院的本科生(转)
- Vim可选插件
- MyBatis之select