【LeetCode】53.Maximum Subarray(Easy)解题报告

最新推荐文章于 2022-07-02 23:14:25 发布

郝春雨

最新推荐文章于 2022-07-02 23:14:25 发布

阅读量308

点赞数

分类专栏： LeetCode Array 文章标签： leetcode

本文链接：https://blog.csdn.net/haoxiaoxiaoyu/article/details/79214778

版权

LeetCode 同时被 2 个专栏收录

183 篇文章 0 订阅

订阅专栏

Array

65 篇文章 0 订阅

订阅专栏

【LeetCode】53.Maximum Subarray(Easy)解题报告

题目地址：https://leetcode.com/problems/maximum-subarray/description/
题目描述：

Find the contiguous subarray within an array (containing at least one number) which has the largest sum.

For example, given the array [-2,1,-3,4,-1,2,1,-5,4],
the contiguous subarray [4,-1,2,1] has the largest sum = 6.

Solution1:

//两种方法，第一种dp
//time:O(n)
//space:O(n)
class Solution {
    public int maxSubArray(int[] nums) {
        int[] dp = new int[nums.length];
        dp[0] = nums[0];
        int res = nums[0];
        for(int i=1;i<nums.length;i++){
            dp[i] = nums[i]+(dp[i-1]>0?dp[i-1]:0);
            res = Math.max(res,dp[i]);
        }
        return res;
    }
}

Solutinon2:

//两种方法，第二种
//time:O(n)
//space:O(1)
class Solution {
    public int maxSubArray(int[] nums) {
        int sum = nums[0];
        int res = nums[0];
        for(int i=1 ; i<nums.length ; i++){
            sum = Math.max(nums[i],sum+nums[i]);
            res= Math.max(res,sum);
        }
        return res;
    }
}