209. Minimum Size Subarray Sum
来源:互联网 发布:sails.js 中文文档 编辑:程序博客网 时间:2024/06/10 05:17
题目
Given an array of n positive integers and a positive integer s, find the minimal length of a contiguous 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.
思路
本题给出一个O(n)的思路。这道题目需要维护两个数组索引i,j。通过不断地增加i或增加j来判断是否有满足条件的值。具体思路看代码实现。
代码
class Solution {public: int minSubArrayLen(int s, vector<int>& nums) { int sum=0,i=0,j=0,min_len=INT_MAX; while(j<nums.size()){ sum+=nums[j++]; while(sum>=s) { min_len = min(min_len,j-i); sum-=nums[i++]; } } return min_len==INT_MAX?0:min_len; }};
阅读全文
1 0
- 209.Minimum Size Subarray Sum
- 209.Minimum Size Subarray Sum
- 209. Minimum Size Subarray Sum
- 209. Minimum Size Subarray Sum
- 209. Minimum Size Subarray Sum
- 209. Minimum Size Subarray Sum
- 209. Minimum Size Subarray Sum
- 209. Minimum Size Subarray Sum
- 209. Minimum Size Subarray Sum
- 209. Minimum Size Subarray Sum
- 209. Minimum Size Subarray Sum
- 209. Minimum Size Subarray Sum
- 209. Minimum Size Subarray Sum
- 209. Minimum Size Subarray Sum
- 209. Minimum Size Subarray Sum
- 209. Minimum Size Subarray Sum
- 209. Minimum Size Subarray Sum
- 209. Minimum Size Subarray Sum
- JavaScript 保留两位小数
- C++类成员冒号初始化以及构造函数内赋值
- 云服务SDK 的嵌入直播系统源码ICould!
- pycharm使用github
- 不错的技术文章链接整理
- 209. Minimum Size Subarray Sum
- 图像分割技术之图像边缘检测
- 每日练习|Day014
- Java位运算
- 社交网络发展前景向好 行业大佬该做SNS应用啦!
- 牛顿法与拟牛顿法
- 【Maven学习】Nexus OSS私服仓库的备份与迁移
- git指令
- 解决3 字节的 UTF-8 序列的字节 3 无效