523. Continuous Subarray Sum
来源:互联网 发布:淘宝助理5.8图片搬家 编辑:程序博客网 时间:2024/06/05 11:20
LeetCode
- 题目地址:https://leetcode.com/problems/continuous-subarray-sum/#/description
- 问题分析&解决思路:问给一个非负的数组,是否存在长度不小于2的连续子数组,使得它们的和是k的整数呗。思路如下,维护一个sum,顺着加,每次加完之后取模,如果发现模相同,则说明能整除(比如mod的顺序分别是是1,3,6,4,3那么第二次和第五次都是sum mod k都是3,说明第二加到第五是k的整数倍)。然后由于要长度不小于2,通过维护一个pre即可,先查询,再插入上一次的mod结果
- 代码如下
class Solution {public: bool checkSubarraySum(vector<int>& nums, int k) { int n = nums.size(), sum = 0, pre = 0; unordered_set<int> modk; for (int i = 0; i < n; ++i) { sum += nums[i]; int mod = k == 0 ? sum : sum % k; if (modk.count(mod)) return true; modk.insert(pre); pre = mod; for (auto j = modk.begin(); j != modk.end(); j++) cout << i << ":" << *j << endl; } 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
- 负载均衡
- 具体实例教你如何做LoadRunner结果分析
- Java编程思想-并发(3)
- Android问题—SQLite存储大二进制文件
- 快速排序
- 523. Continuous Subarray Sum
- 可靠简单的 解决Microsoft.Jet.OLEDB.4.0 不能在64位系统下使用的问题
- DER 和 PEM 格式
- B
- Altium Designer17添加3D封装后元件是绿色的
- 6.2判断一个数能否被3整除,如果不能整除就抛出一个异常,并让其调用方法来捕获,显示相应的处理信息
- gradle使用
- 在python中导入gensim出错
- JQuery Div scrollTop ScrollHeight