Method minSubArrayLen

SubarraySumGreaterThanX.java:37–59

(int target, int[] nums)

class Solution {
    public int minSubArrayLen(int target, int[] nums) {
        int start=0,end=1;
        int sum=nums[start];
        if(sum >= target) return 1;
        int n = nums.length;
        int result = Integer.MAX_VALUE;
        if(end<nums.length) sum+=nums[end];
        while(start<n && end<n)
        {
            if(sum>=target)
            {
               result=Math.min(result,end-start+1);
               sum-=nums[start];
               start++;
            }
            else
            {
                end++; 
                if(end<n) sum+=nums[end];
            }
        }
        return (result == Integer.MAX_VALUE)?0:result;
    }
}