LeetCode 53. Maximum Subarray

Description:
Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.

Example:

Input: [-2,1,-3,4,-1,2,1,-5,4],
Output: 6
Explanation: [4,-1,2,1] has the largest sum = 6.

Solution:
这个题目严格意义上算dp，但是他只需要用到 i - 1 步的数据，所以都不用分配一个数组。
解法和 这个题目很类似 个人觉得还是很像的，前者比大取大，后者比小取小。

public int maxSubArray(int[] nums) {
        
        int maxCurrent = nums[0];
        int dp = nums[0];
        
        for(int i = 1; i < nums.length; ++i) {
            maxCurrent = nums[i] + (maxCurrent > 0 ? maxCurrent : 0);
            dp = (dp > maxCurrent ? dp : maxCurrent);
        }
        return dp;
    }