44-z最小子数组

4.19

（1） 暴力

public class Solution {
    /**
     * @param nums: a list of integers
     * @return: A integer indicate the sum of minimum subarray
     */
    public int minSubArray(ArrayList<Integer> nums) {
        if(nums == null ){  
            return 0;  
        }  
        if(nums.size() ==1){  
            return nums.get(0);  
        }  
          
        int length = nums.size();  
        int min = nums.get(0);  
        for(int i = 0; i<length; i++){  
            int tmp = nums.get(i);
            if(tmp < min){  
                min = tmp;  
            } 
            for(int j = i+1;j < length ; j++){  
                tmp += nums.get(j);  
                if(tmp < min){  
                    min =  tmp;  
                }  
            }  
            if(tmp < min){  
                min = tmp;  
            }  
        }  
        return min;  
    }
}