skip to content
developertype

snippets

filter:96 snippets
py-lc-maxsubarray·python·leetcode
class Solution:
    def maxSubArray(self, nums):
        best = curr = nums[0]
        for n in nums[1:]:
            curr = max(n, curr + n)
            best = max(best, curr)
        return best