LeetCode 53. Maximum Subarray - Python

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

A subarray is a contiguous part of an array.

[maged_helmy]

class Solution:
def maxSubArray(self, nums: List[int]) -> int:

for idx in range(1, len(nums)):
if nums[idx-1] > 0:
nums[idx] += nums[idx-1]

return max(nums)