package leetcode;

/**
 * https://leetcode.com/problems/minimum-size-subarray-sum/
 */
public class Problem209 {
    public int minSubArrayLen(int s, int[] nums) {
        // TODO
        return 0;
    }

    public static void main(String[] args) {
        Problem209 prob = new Problem209();
    }
}

@@ -169,127 +169,712 @@
     
-// TODO%0A        return 0;%0A    %7D%0A%0A    public static void main(String%5B%5D args) %7B%0A        Problem209 prob = new Problem209(
+for (int i = 1; i %3C nums.length; i++) %7B%0A            for (int j = 0; j %3C nums.length; j++) %7B%0A                int sum = 0;%0A                for (int x = j; x %3C j+i && x %3C nums.length; x++) %7B%0A                    sum += nums%5Bx%5D;%0A                %7D%0A                if (sum %3E= s) %7B%0A                    return i;%0A                %7D%0A            %7D%0A        %7D%0A        return 0;%0A    %7D%0A%0A    public static void main(String%5B%5D args) %7B%0A        Problem209 prob = new Problem209();%0A//        System.out.println(prob.minSubArrayLen(7, new int%5B%5D%7B2, 3, 1, 2, 4, 3%7D));%0A//        System.out.println(prob.minSubArrayLen(3, new int%5B%5D%7B2, 3, 1, 2, 4, 5%7D));%0A        System.out.println(prob.minSubArrayLen(7, new int%5B%5D%7B2, 3, 1, 2, 4, 5%7D)
 );%0A 

Update problem 209