LintCode-44. 最小子数组

public class Solution {
    /*
     * @param nums: a list of integers
     * @return: A integer indicate the sum of minimum subarray
     */
    public int minSubArray(List<Integer> nums) {
        // write your code here
        int sum = nums.get(0);
        for(int i = 0; i < nums.size(); i++){
            int temp = 0;
            for(int j = i; j < nums.size(); j++){
                temp += nums.get(j);
                if(temp < sum) sum = temp;
            }
        }
        return sum;
    }
}