33. Maximum Subarray
MediumDynamic programming
Return the largest sum of any contiguous, non-empty subarray of nums.
Example 1
Input: nums = [-2, 1, -3, 4, -1, 2, 1, -5, 4] Output: 6 Explanation: [4, -1, 2, 1]
Example 2
Input: nums = [-3, -1, -2] Output: -1
Constraints
1 ≤ nums.length ≤ 10⁵