LeetCode 53. Maximum Subarray - Python

[@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)