[53] Maximum Subarray

https://leetcode.com/problems/maximum-subarray/description/

• algorithms
• Easy (41.84%)
• Source Code: 53.maximum-subarray.py
• Total Accepted: 502.9K
• Total Submissions: 1.2M
• Testcase Example: '[-2,1,-3,4,-1,2,1,-5,4]'

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(object):
    def maxSubArray(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        if not nums: return 0
        lenn = len(nums)
        DP = [i for i in nums]

        for i in range(1, lenn):
            if DP[i-1] > 0:
                DP[i] = DP[i-1] + nums[i]

        return max(DP)