Given an integer array nums, find the subarray with the largest sum, and return its sum.
The subarray must contain at least one number.
Examples
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.
Input: nums = [1] Output: 1
Input: nums = [5,4,-1,7,8] Output: 23
Constraints
- 1 <= nums.length <= 100,000
- -10,000 <= nums[i] <= 10,000