5. Maximum Subarray
Given an integer array nums, find the contiguous subarray with the largest sum and return its sum.
Example 1:
Input: nums = [-2,1,-3,4,-1,2,1,-5,4] Output: 6
Example 2:
Input: nums = [1] Output: 1
Constraints:
1 <= nums.length <= 10^5