Find the contiguous subarray with the largest sum.
With nums = [-2,1,-3,4,-1,2,1,-5,4]:
- Subarray [4,-1,2,1] has sum .
- No contiguous subarray has a larger sum.
- Answer: .
With nums = [1]:
- Only one element. Answer: .
With nums = [5,4,-1,7,8]:
- Entire array: .
- Answer: .
Constraints: nums.length .