Maximum Subarray Sum

Given an integer array nums, find the contiguous, non-empty subarray with the largest sum, and return that 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

Example 3

Input: nums = [5, 4, -1, 7, 8]
Output: 23
Explanation: The whole array is the best subarray.

Constraints

• 1 <= nums.length <= 10^5
• -10^4 <= nums[i] <= 10^4