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.

 

public class Solution {
    public int MinSubArrayLen(int s, int[] nums) {
        int result = Int32.MaxValue, sum = 0, i = 0, j = 0;
        
        while (j < nums.Length)
        {
            sum += nums[j];
            
            while (i <= j && sum >= s)
            {
                result = Math.Min(result, j - i + 1);
                sum -= nums[i];
                i++;
            }
            
            j++;
        }
        
        return result == Int32.MaxValue ? 0 : result;
    }
}