(M)Dynamic Programming:523. Continuous Subarray Sum
来源:互联网 发布:squid nginx 编辑:程序博客网 时间:2024/06/06 17:41
这道题一开始理解错了题意,后来发现大神的解法也很暴力:
遇到这种求子数组或者子矩阵之和的题,应该不难想到要建立累加和数组或者累加和矩阵来做。没错,这道题也得这么做,我们要遍历所有的子数组,然后利用累加和来快速求和。在得到每个子数组之和时,我们先和k比较,如果相同直接返回true,否则再判断,若k不为0,且sum能整除k,同样返回true,最后遍历结束返回false。
(不太懂这里为什么要先和k比较,)
class Solution {public: bool checkSubarraySum(vector<int>& nums, int k) { for(int i = 0; i < nums.size(); ++i) { int sum = nums[i]; for(int j = i + 1; j < nums.size(); ++j) { sum += nums[j]; if(sum == k) return true; if(k != 0 && sum % k == 0) return true; } } return false; }};
阅读全文
0 0
- (M)Dynamic Programming:523. Continuous Subarray Sum
- LeetCode: -Dynamic Programming-Continuous Subarray Sum[523]
- LeetCode-Easy部分中标签为Dynamic Programming 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
- Codeforces Problem 333D. Characteristics of Rectangles
- servlet 杂谈
- 亚马逊:您的评论无法发布。 (靠)
- 【c++】关于继承
- svn,maven工程注意事项
- (M)Dynamic Programming:523. Continuous Subarray Sum
- sqlalchemy建表第二式
- chmod g+s 、chmod o+t 、chmod u+s
- 文件压缩和解压缩
- 异常的捕获或处理
- Hello World! New journey....
- 编程语言、框架等命名由来
- pycharm2017,webstore2017和idea2017注册
- XGBoost原理