【LeetCode】Minimum Size Subarray Sum
来源:互联网 发布:易经入门书籍推荐 知乎 编辑:程序博客网 时间:2024/05/18 03:14
Minimum Size Subarray Sum
Total Accepted: 5312 Total Submissions: 22940 My Submissions Question Solution
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.
click to show more practice.
Credits:
Special thanks to @Freezen for adding this problem and creating all test cases.
前提是,left需要右移,一直到sum < s为止,再计算下一个sum。
Total Accepted: 5312 Total Submissions: 22940 My Submissions Question Solution
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.
click to show more practice.
Credits:
Special thanks to @Freezen for adding this problem and creating all test cases.
【解题思路】
最小滑动窗口。
设定两个指针,每次sum+nums[right],如果sum >= s就记录下长度。然后重新计算下一轮。前提是,left需要右移,一直到sum < s为止,再计算下一个sum。
Java AC
public class Solution { public int minSubArrayLen(int s, int[] nums) { if (nums == null || nums.length == 0) { return 0; } int len = nums.length; int sum = 0; int minLen = len + 1; int left = 0; int right = 0; while (right < len) { sum += nums[right]; while (sum >= s) { int curLen = right - left + 1; minLen = minLen > curLen ? curLen : minLen; sum -= nums[left]; left++; } right++; } return minLen == len + 1 ? 0 : minLen; }}
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
- maven中进行junit测试报class not found的问题
- iOS设备上回声消除的例子
- 联诚发(LCF):用大数据看小间距屏
- 各种排序算法的分析及java实现
- Pool of Argument Topics 1-10
- 【LeetCode】Minimum Size Subarray Sum
- centos6下手工编译vitess
- ubuntu下安装kermit实现串口登录Ordoid U3
- Vim学习笔记--复制粘贴
- linux下搭建SVN服务器
- 在pentaho4.8中插件Saiku保存为中文文件名
- 逻辑坐标和设备坐标的区别
- UIWebView的使用
- 策略模式