leetcode209. Minimum Size Subarray Sum
来源:互联网 发布:迪蒙小额贷款系统源码 编辑:程序博客网 时间:2024/05/16 04:46
209. Minimum Size Subarray Sum
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.
解法
public class Solution { public int minSubArrayLen(int s, int[] nums) { if (nums == null || nums.length == 0) { return 0; } int sum = 0, len = 0, minLen = Integer.MAX_VALUE; for (int i = 0; i < nums.length; i++) { sum += nums[i]; len++; if (sum >= s) { if (len < minLen) { minLen = len; } i = i - len + 1; len = 0; sum = 0; } } return minLen != Integer.MAX_VALUE ? minLen : 0; }}
阅读全文
1 0
- Leetcode209-Minimum Size Subarray Sum
- leetcode209. Minimum Size Subarray Sum
- LeetCode209—Minimum Size Subarray Sum
- leetcode209-Minimum Size Subarray Sum(最小长度子数组和)
- Minimum Size Subarray Sum
- Minimum Size Subarray Sum
- Minimum Size Subarray Sum
- Minimum size subarray sum
- Minimum Size Subarray Sum
- Minimum Size Subarray Sum
- Minimum Size Subarray Sum
- Minimum Size Subarray Sum
- Minimum Size Subarray Sum
- Minimum Size Subarray Sum
- Minimum Size Subarray Sum
- Minimum Size Subarray Sum
- Minimum Size Subarray Sum
- Minimum Size Subarray Sum
- UVA 12627 Erratic Expansion (递归,分治)
- http://blog.csdn.net/znyyjk/article/details/52717336
- css资源收集
- java中的反射
- 正则表达式
- leetcode209. Minimum Size Subarray Sum
- 【用Python学习Caffe】4. 设计自己的网络结构
- 一文看懂大数据的技术生态圈,Hadoop,hive,spark都有了
- 计算机网络体系结构
- ConcurrentHashMap的锁分离技术
- raytracing
- 项目进度(十一)
- 那些让人一见钟情的网页首屏,遵循着怎样的设计模式?
- 【排序算法】 堆排序 heap sort(选择类排序)