209. Minimum Size Subarray Sum

最新推荐文章于 2024-09-02 14:20:50 发布

csdnzhaocsdn

最新推荐文章于 2024-09-02 14:20:50 发布

阅读量54

点赞数

分类专栏： LeetCode 双指针

本文链接：https://blog.csdn.net/qq_39360744/article/details/104264871

版权

LeetCode 同时被 2 个专栏收录

109 篇文章 0 订阅

订阅专栏

双指针

25 篇文章 0 订阅

订阅专栏

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.

Example:

Input: s = 7, nums = [2,3,1,2,4,3]
Output: 2
Explanation: the subarray [4,3] has the minimal length under the problem constraint.
Follow up:
If you have figured out the O(n) solution, try coding another solution of which the time complexity is O(n log n).

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/minimum-size-subarray-sum
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

class Solution {
    public int minSubArrayLen(int s, int[] nums) {
        int len = nums.length;
        int ans = 0;
        int sum = 0;
        int L=0, R=0;
        while(R < len){
            sum += nums[R];
            while(sum >= s){
                ans = ans==0 ? R-L+1 : Math.min(ans, R-L+1);
                sum -= nums[L++];
            }
            R++;
        }
        return ans;
    }
}