Given an integer array nums, find the subarray with the largest sum, and return its sum.
Example 1:
Input: nums = [-2,1,-3,4,-1,2,1,-5,4]
Output: 6
Explanation: The subarray [4,-1,2,1] has the largest sum 6.
Example 2:
Input: nums = [1]
Output: 1
Explanation: The subarray [1] has the largest sum 1.
Example 3:
Input: nums = [5,4,-1,7,8]
Output: 23
Explanation: The subarray [5,4,-1,7,8] has the largest sum 23.
Solution
class Solution:
def maxSubArray(self, nums: List[int]) -> int:
best_sum = float('-inf')
cur_sum = 0
for n in nums:
cur_sum = max(n, cur_sum + n)
best_sum = max(best_sum, cur_sum)
return best_sum