[LeetCode][Array] 53. Maximum Array

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

Solution1:
Brute Force - Time Limit Exceeded

class Solution {
    public int maxSubArray(int[] nums) {
        // brute force
        int ans = Integer.MIN_VALUE;
        for(int i = 0; i < nums.length; i++) {
            for(int j = 0; j < nums.length; j++) {
                int sum = 0;
                for(int k = i; k <= j; k++) {
                    sum += nums[k];
                    if (sum > ans) {
                        ans = sum;
                    }
                }
            }
        }
        return ans;
    }
}

Solution2:
动态规划算法：
dp[0] = A[0]
dp[i] = max{ dp[i-1] + A[i] , A[i] }
dp[]为加到第 i 位时的最大和

class Solution {
    public int maxSubArray(int[] nums) {
        int dp[] = new int[nums.length];
        dp[0] = nums[0];
        int max = dp[0];
        for(int i = 1; i < nums.length; i++) {
            dp[i] = Math.max(dp[i-1] + nums[i], nums[i]);
            if (max < dp[i]) {
                max = dp[i];
            }
        }
        return max;
    }
}

Solution3:
优化动态规划，因为dp[i]只依赖dp[i-1]，所以可以将dp[]进行优化

class Solution {
    public int maxSubArray(int[] nums) {
        int max = nums[0];
        int endPos = nums[0];
        for(int i = 1; i < nums.length; i++) {
            endPos = Math.max(endPos + nums[i], nums[i]);
            if (max < endPos) {
                max = endPos;
            }
        }
        return max;
    }
}