leetcode -- 53. Maximum Subarray

题目描述

题目难度：Easy
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.
Follow up:

If you have figured out the O(n) solution, try coding another solution using the divide and conquer approach, which is more subtle.

AC代码1

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

AC代码2

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