leetcode-Minimum Size Subarray Sum
来源:互联网 发布:简易数控折弯机编程 编辑:程序博客网 时间:2024/05/21 10:52
Given an array of n positive integers and a positive integer s, find the minimal length of a subarray of which the sum ≥ s. If there isn't one, return 0 instead.
For example, given the array [2,3,1,2,4,3]
and s = 7
,
the subarray [4,3]
has the minimal length under the problem constraint.
cclass Solution {public: int minSubArrayLen(int s, vector<int>& nums) { if(nums.size()<=0) return 0; int minlen=nums.size()+1,sum=nums[0],first=0,second=0; while(first<=second) { if(sum>=s) { if(second-first+1<minlen) minlen=second-first+1; sum-=nums[first]; first++; } else { second++; if(second<nums.size()) sum+=nums[second]; else break; } } if(minlen!=nums.size()+1) return minlen; else return 0; }};
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
- 基于新闻网页的关键词提取系统——问题汇总
- IOS开发学习十 沙盒查看
- C#,SQL 日期格式转换
- 机器学习经典论文/survey合集
- visualVM的博客记录
- leetcode-Minimum Size Subarray Sum
- [BUG]UITapGestureRecognizer和UITableView的冲突(didSelectRowAtIndexPath无反应)
- ISO语言代码(ISO-639)与国家代码(ISO-3166)
- nginx+tomcat+memcached (msm)实现 session同步复制
- Android 最火的快速开发框架XUtils
- 归并排序
- 63要一直喝么?学自动挡C1 驾照难吗?计啦离颖恍嘲拿斟
- 64总是批评你的朋友算是好朋友吗?党篮挡泄霜
- 01背包和完全背包