53. Maximum Subarray#1

Solution#1

public class Solution {
    public int maxSubArray(int[] nums) {
        if (nums == null || nums.length == 0) return 0;

        int index = 0;
        int sum = 0;
        int max = Integer.MIN_VALUE;
        int count = 0;
        while (index + count < nums.length) {
            sum += nums[index + count];
            count++;
            if (sum > max) {
                max = sum;
            }
            if (sum < 0) {
                index += count;
                count = 0;
                sum = 0;
            }
        }
        return max;
    }
}

Problem#1
1. 负数不能跳过
2. Integer.MIN_VALUE
3. 分治法？
4. 这是最优化问题，动态规划(DP)