Leetcode Minimum Size Subarray Sum
来源:互联网 发布:vrsjg用什么软件 编辑:程序博客网 时间:2024/04/30 12:52
题意:找出最短的连续数列,使其各项之和大于给定值。
思路:先判断是否存在这样的数列。枚举以每一个元素结尾的满足条件的最短数列,枚举的时候保持一个指针,指向满足条件数列开始的位置。
class Solution {public: int minSubArrayLen(int s, vector<int>& nums) { vector <int> p(nums.size(), -1); int sum = 0; int st = 0; for(int i = 0; i < nums.size(); ++ i) { sum += nums[i]; } if(sum < s) return 0; sum = 0; for(int i = 0; i < nums.size(); ++ i) { sum += nums[i]; if(sum < s) continue; else { while(sum >= s) { sum -= nums[st]; p[i] = st; st ++; } //st --; } } int shortest = nums.size(); for(int i = 0; i < nums.size(); ++ i) { //cout << p[i] << endl; if(p[i] != -1) { if(shortest > i - p[i]) shortest = i - p[i] + 1; } } return shortest; }};
0 0
- leetcode-Minimum Size Subarray Sum
- 【LeetCode】Minimum Size Subarray Sum
- [LeetCode] Minimum Size Subarray Sum
- LeetCode Minimum Size Subarray Sum
- [leetcode]Minimum Size Subarray Sum
- [leetCode] Minimum Size Subarray Sum
- leetcode Minimum Size Subarray Sum
- LeetCode Minimum Size Subarray Sum
- leetcode:Minimum Size Subarray Sum
- [Leetcode]Minimum Size Subarray Sum
- Leetcode: Minimum Size Subarray Sum
- [LeetCode]Minimum Size Subarray Sum
- [leetcode] Minimum Size Subarray Sum
- 【LeetCode】Minimum Size Subarray Sum
- Minimum Size Subarray Sum -- leetcode
- leetcode--Minimum Size Subarray Sum
- leetcode:Minimum Size Subarray Sum
- 【leetcode】Minimum Size Subarray Sum
- Spark Job调优(Part 2)
- 博世传感器调试笔记(三)加速度及地磁传感器BMC156
- [iOS]PKPass文件制作及添加到Wallet
- javaMath
- Android基础学习笔记之-ListView进阶用法(item圆角效果实现)
- Leetcode Minimum Size Subarray Sum
- 新手入门百度地图开发的(0,0)坐标问题
- 一个ThreeJS的毕业设计及一点思考
- 程序员增加收入的实用之道
- 38.表单
- Eclipse连接真机--华为荣耀6
- 关于SpringMVC提交表单出现乱码的情况
- Android之FloatingActionButton使用
- Jungle Roads 【最小生成树】(构造图)