0053 Maximum Subarray

Solved at: 2022-09-05

Question

Given an integer array nums, find the contiguous subarray (containing at least one number) with the largest sum and return its sum.

A subarray is a contiguous part of an array.

Solution

class Solution:
    def maxSubArray(self, nums: List[int]) -> int:
        current = 0
        largest = -inf
        for i in nums:
            current += i
            if current > largest:
                largest = current
            if current < 0:
                current = 0
        return largest