题解:Continuous Subarray Sum
来源:互联网 发布:win10网络凭证 编辑:程序博客网 时间:2024/06/05 05:15
题目:
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.
直接循环求解即可,注意k=0的情况分开讨论
bool checkSubarraySum(vector<int>& nums, int k) {for (int i = 0; i < nums.size() - 1; i++) {int sum = nums[i];for (int l = i + 1; l < nums.size(); l++) {sum += nums[l];if (k == 0) {if (sum == 0)return true;elsereturn false;}else if (sum % k == 0)return true;}}return false;}
0 0
- 题解:Continuous Subarray Sum
- 【LeetCode题解】523. Continuous Subarray Sum
- LeetCode 题解(Week 8): 523. Continuous Subarray Sum
- lintcode:Continuous Subarray Sum
- Continuous Subarray Sum II
- [LintCode] Continuous Subarray Sum
- [Lintcode] Continuous Subarray Sum
- Continuous Subarray Sum
- 【LeetCode523】. Continuous Subarray Sum
- [LeetCode]Continuous Subarray Sum
- 523. Continuous Subarray Sum
- 523. Continuous Subarray Sum
- 523. Continuous Subarray Sum
- leetcode523. Continuous Subarray Sum
- 523. Continuous Subarray Sum
- Continuous Subarray Sum
- 523. Continuous Subarray Sum
- 523. Continuous Subarray Sum
- 魔力手环-网易互联网2017在线笔试题目
- 死锁的案例
- 安卓数据存储-使用LitePal操作数据库
- 浅谈协方差矩阵
- 如何整理个人桌面?
- 题解:Continuous Subarray Sum
- C/C++经典程序训练3---模拟计算器
- Mac上MyEclipse创建java后台程序访问MySQL本地数据库
- 微信小程序 判断是否是手机号
- java.util.ListIterator<E>
- 删除排序链表中的重复元素
- 网易2017年实习生NLP岗编程题--赶去公司
- 第一次发表
- 【POJ2406】Power Strings(KMP与最小循环节的故事)