Given an integer array `nums`, find the subarray with the largest sum, and return *its sum*.
Examples
Example 1
Input:
nums = [-2,1,-3,4,-1,2,1,-5,4]Output:
6The subarray [4,-1,2,1] has the largest sum 6.
Example 2
Input:
nums = [1]Output:
1Example 3
Input:
nums = [5,4,-1,7,8]Output:
23Constraints
- •
1 <= nums.length <= 10^5 - •
-10^4 <= nums[i] <= 10^4
Code Editor