#53

Maximum Subarray

specialist · 820 · lc medium +31 · verified · 53% accepted · 37,606 likes · top 44%

play →

Description

Return the largest sum achievable by any contiguous subarray of integer array nums.

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.

Code

1
2
3