https://oj.leetcode.com/problems/maximum-subarray/

Maximum Subarray.java

public class Solution {
    public int maxSubArray(int[] A) {
        int sum = Integer.MIN_VALUE;  
        int ret = Integer.MIN_VALUE;
        int length = A.length;
        for(int i = 0; i < A.length; i++){  
            if (sum < 0){            
                sum = A[i];
            }else{
                sum += A[i];
            }
            if (ret < sum) ret = sum;
        }  
        return ret;  
    }
}

贪心贪心~