最大子数组（LintCode）

 1 public class Solution {
 2     /**
 3      * @param nums: A list of integers
 4      * @return: A integer indicate the sum of max subarray
 5      */
 6     public int maxSubArray(int[] nums) {
 7         int sum = nums[0];
 8         int max = nums[0];
 9         for(int i = 1 ;i < nums.length ;i++) {
10             if(nums[i] < 0) {
11                 if(sum > max) max = sum;
12             }
13             
14             if(sum < 0) {
15                 sum = nums[i];
16             }else {
17                 sum+=nums[i];
18             }
19         }
20         return max>sum?max:sum;
21     }
22 }