Lintcode: Minimum Subarray 解题报告

 1 public class Solution {
 2     /**
 3      * @param nums: a list of integers
 4      * @return: A integer indicate the sum of minimum subarray
 5      */
 6     public int minSubArray(ArrayList<Integer> nums) {
 7         // write your code
 8         
 9         int len = nums.size();
10         
11         int max = Integer.MIN_VALUE;
12         int sum = 0;
13         for (int i = 0; i < len; i++) {
14             if (sum < 0) {
15                 sum = -nums.get(i);
16             } else {
17                 sum += -nums.get(i);
18             }
19             
20             max = Math.max(max, sum);
21         }
22         
23         return -max;
24     }
25 }