LeetCode_209:长度最小的子数组：Java

package LeetCode.contact;

public class leetcode_209 {	//长度最小的子数组
	public static void main(String[] args) {
		Solution_209 sol = new Solution_209();
		int[] arr = new int[]{1,7,8,3,2,5,6};
		System.out.println(sol.minSubArrayLen(12, arr));
	}
}

class Solution_209 {
    public int minSubArrayLen(int target, int[] nums) {
    	int n = nums.length;
    	if(n == 0){
    		return 0;
    	}
    	int time = Integer.MAX_VALUE;		//求最小子数组，和其int最大值比较
    	for(int i = 0; i < n; i++){
    		int sum = 0;
    		for(int j = i; j<n; j++){
    			sum += nums[j];
    			if(sum >= target){
    				time = Math.min(time, j - i + 1);
    				break;
    			}
    		}
    	}
    	
    	return time == Integer.MAX_VALUE ? 0 : time;		//如果time等于最大值，即找不到最小子数组返回0，否则返回time
    }
}