leetcode-53 最大子序和 Java

https://leetcode-cn.com/problems/maximum-subarray/solution/bao-li-qiu-jie-by-pandawakaka/

方法一：贪心

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

方法二：动态规划

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

方法三：分治(Python)

class Solution:
    def maxSubArray(self, nums: List[int]) -> int:
        n = len(nums)
        mid = len(nums) // 2
        if n == 1 :
            return nums[0]
        else:
            max_left = self.maxSubArray(nums[0:mid])
            max_right = self.maxSubArray(nums[mid:n])
        
        max_l = nums[mid - 1]
        tmp = 0 
        for i in range(mid - 1, -1, -1):
            tmp += nums[i]
            max_l = max(tmp, max_l)
        max_r = nums[mid]
        tmp = 0
        for i in range(mid, n):
            tmp += nums[i]
            max_r = max(tmp, max_r)
        return max(max_right, max_left, max_l+max_r)