53. 最大子序和-两种解法-Java

leetcode链接在这里

// @lc code=start
class Solution {
    public int maxSubArray(int[] nums) {
        if(nums.length == 0){
             return 0;
        }
        
        


        



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