53. Maximum Subarray

最新推荐文章于 2022-07-14 19:35:25 发布

这里是个记录贴

最新推荐文章于 2022-07-14 19:35:25 发布

阅读量85

点赞数

本文链接：https://blog.csdn.net/zzzyqsama/article/details/100520552

版权

Maximum Subarray
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.
python：

class Solution:
    def maxSubArray(self, nums: List[int]) -> int:
        maxn  = min(nums)
        sumN = 0
        for i in nums:
            if sumN<0:
                sumN = i
            else:
                sumN +=i
            if sumN >maxn:
                maxn = sumN
        return maxn

java：

class Solution {
    public int maxSubArray(int[] nums) {
        int maxn = nums[0];
        int summ = 0;
        for(int i:nums){
            if (summ<0)
                summ = i;
            else
                summ += i;
            if (summ>maxn)
                maxn = summ;
            
        }
        return maxn;
    }
}