in LintCode Algorithm Array Dynamic Programming ~ read.

Maximum Subarray

LintCode-41.Maximum Subarray

Given an array of integers, find a contiguous subarray which has the largest sum.

Notice: The subarray should contain at least one number.

Given the array [−2,2,−3,4,−1,2,1,−5,3], the contiguous subarray [4,−1,2,1] has the largest sum = 6.

public class Solution {  
    /**
     * @param nums: A list of integers
     * @return: A integer indicate the sum of max subarray
     */
    public int maxSubArray(int[] nums) {
        if (nums == null || nums.length == 0) {
            return 0;
        }

        int sum = 0;
        int max = Integer.MIN_VALUE;
        for (int i = 0; i < nums.length; i++) {
            sum = Math.max(sum + nums[i], nums[i]);
            max = Math.max(max, sum);
        }

        return max;
    }
}

Hope this helps,
Michael