Posted on | Edited on

https://leetcode.com/problems/minimum-size-subarray-sum/

two pointers
Explanation-solution-(two-pointers))

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
class Solution {
    public int minSubArrayLen(int s, int[] nums) {
        if(nums==null||nums.length==0) return 0;
        int l=0,r=0;
        int minLen=Integer.MAX_VALUE;
        int sum=0;
        while(r<nums.length){  
            sum+=nums[r++];
            while(sum>=s){
                minLen=r-l<minLen?r-l:minLen;
                sum-=nums[l++];
            }             
        }
        return minLen==Integer.MAX_VALUE?0:minLen;
    }
}
/*
class Solution {
    public int minSubArrayLen(int s, int[] nums) {
        if(nums==null||nums.length==0) return 0;
        int l=0,r=0;
        int minLen=Integer.MAX_VALUE;
        int sum=0;
        while(l<=r&&r<=nums.length){ 
            if(sum<s&&r==nums.length) break;
            if(sum<s){ 
                sum+=nums[r];
                r++;
            }
            if(sum>=s){
                minLen=r-l<minLen?r-l:minLen;
                sum-=nums[l];
                l++;
            }             
        }
        return minLen==Integer.MAX_VALUE?0:minLen;
    }
}*/

0%