首页 > 代码库 > leetcode 209. Minimum Size Subarray Sum
leetcode 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.
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).
好题目，想法有了，就是实现的时候出现了偏差，导致很长时间没有ac，后来还是看的别人的代码
class Solution {public: int minSubArrayLen(int s, vector<int>& nums) { int n = nums.size(); if (n == 0) return 0; int l = 0, r = 0; int sum = 0; int Min = n + 1; while (l < n && r < n) { while (sum < s && r < n) sum += nums[r++]; while (sum >= s && l < n) { Min = min(Min, r - l); sum -= nums[l++]; } } if (Min == n + 1) return 0; return Min; }};
leetcode 209. Minimum Size Subarray Sum
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。