Problem

Given an integer array nums, return the largest possible sum of any non-empty contiguous subarray. A contiguous subarray consists of elements that appear next to each other in the original array.

Examples

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.

Example 2:

Input: nums = [1]
Output: 1
Explanation: The only non-empty contiguous subarray is [1].

Constraints

• 1 <= nums.length <= 10^5
• -10^4 <= nums[i] <= 10^4
• The answer must come from a non-empty contiguous subarray.