LC-0053 Medium LeetCode

53. Maximum Subarray

Array Divide and Conquer Dynamic Programming

Read the full problem statement on LeetCode.

Difficulty: medium Acceptance: 52% Topics: Array, Divide and Conquer, Dynamic Programming

Reading material

Arrays & Hashing 12 min Divide & Conquer 11 min 1-D Dynamic Programming 16 min

Reference solution (spoiler · python)

# Time:  O(n)
# Space: O(1)

class Solution(object):
    def maxSubArray(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        result, curr = float("-inf"), float("-inf")
        for x in nums:
            curr = max(curr+x, x)
            result = max(result, curr)
        return result

Solution from kamyu104/LeetCode-Solutions · MIT