leetcode题解-209. Minimum Size Subarray Sum
来源:互联网 发布:淘宝网丝巾韩杰 编辑:程序博客网 时间:2024/06/17 08:05
题目:
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.
这道题目很简单,目的是寻找和大于等于target的最小子串长度,我们只需要使用一个游标来标识子串起点,然后用sum记录当前子串和。此外需要注意的是当sum大于target时,我们需要写一个循环来将起点不断向右移动。代码如下所示;
public int minSubArrayLen(int s, int[] nums) { int left=0, sum=0, min = Integer.MAX_VALUE; for(int i=0; i<nums.length; i++){ sum += nums[i]; while(sum >= s) { min = Math.min(min, i - left + 1); sum -= nums[left++]; } } if(min == Integer.MAX_VALUE) return 0; return min ; }
0 0
- leetcode题解-209. Minimum Size Subarray Sum
- [leetcode] 209.Minimum Size Subarray Sum
- 【leetcode】209. Minimum Size Subarray Sum
- <LeetCode OJ> 209. Minimum Size Subarray Sum
- [Leetcode]209. Minimum Size Subarray Sum
- [LeetCode]209. Minimum Size Subarray Sum
- leetcode 209. Minimum Size Subarray Sum
- 209. Minimum Size Subarray Sum LeetCode
- LeetCode 209. Minimum Size Subarray Sum
- LeetCode *** 209. Minimum Size Subarray Sum
- 【leetcode】209. Minimum Size Subarray Sum
- LeetCode 209. Minimum Size Subarray Sum
- leetcode.209. Minimum Size Subarray Sum
- 【LeetCode】209. Minimum Size Subarray Sum
- [Leetcode]209. Minimum Size Subarray Sum
- [leetcode]209. Minimum Size Subarray Sum[存疑]
- [leetcode] 209. Minimum Size Subarray Sum
- leetcode 209. Minimum Size Subarray Sum
- poj 3259 Wormholes(spfa)
- 孤儿进程与僵尸进程的实现与总结
- java编程思想-内存空间分配(常量池)
- C++提高输入输出 效率
- 资金存管需要的材料
- leetcode题解-209. Minimum Size Subarray Sum
- 最小生成树之算法记录【prime算法+Kruskal算法】【模板】
- hadoop mapreduce详细过程分析
- 多线程的一次实践
- 制作板子的一些总结心得
- 1005.继续(3n+1)猜想(c语言)
- Spring学习笔记(三)
- 1006: IP判断
- 触控事件MotionEvent