53. 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.

class Solution:
    def maxSubArray(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        num , current = nums[0],-1
        if len(nums)==1:
            return num
        for i in nums:
            if current>=0:
                current += i
            else:
                current = i
            num = max(num,current)
        return num

转载于:https://www.cnblogs.com/bernieloveslife/p/9715037.html