209. Minimum Size Subarray Sum 【M】【35】
来源:互联网 发布:苹果看书软件 编辑:程序博客网 时间:2024/06/11 07:25
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.
More practice:
If you have figured out the O(n) solution, try coding another solution of which the time complexity is O(n log n).
Credits:
Special thanks to @Freezen for adding this problem and creating all test cases.
Subscribe to see which companies asked this question
一个很有趣的双指针
从头到尾遍历,b每次增大一,然后观察a可以减少几个
class Solution(object): def minSubArrayLen(self, s, nums): if sum(nums) < s: return 0 minn = 2 << 30 a,b = 0,0 total = nums[0] res = 0 while total + nums[b] < s: b += 1 total += nums[b] res = b + 1 while b < len(nums): while total - nums[a] >= s: total -= nums[a] a += 1 res = b - a + 1 minn = min(minn,res) b += 1 try: total += nums[b] except: break return minn
0 0
- 209. Minimum Size Subarray Sum 【M】【35】
- 209.Minimum Size Subarray Sum(M)
- 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
- 模拟退火算法求解TSP
- Android 实现对图片 Exif 的修改(Android 自带的方法)
- [容器]STL之vector容器详解
- 系统学习Linux系统第一天:5-11
- MySQL快速入门(二)
- 209. Minimum Size Subarray Sum 【M】【35】
- 37.数组中只出现一次的数字
- (4.1.23.13)自定义控件三部曲之动画篇(十一)——layoutAnimation与gridLayoutAnimation
- 蓝桥杯 算法提高 拿糖果(筛法+动态规划)
- 五虎棋
- 【安卓中的缓存策略系列】安卓缓存策略之磁盘缓存DiskLruCache
- HDU 1241 Oil Deposits
- 随便写写
- [容器]STL之deque容器详解