Maximum Subarray

MEDIUM

Maximum Subarray

Given an integer array nums, find the subarray with the largest sum, and return its sum.

Examples

Input: nums = [-2,1,-3,4,-1,2,1,-5,4]
Output: 6

Constraints

  • 1 ≤ nums.length ≤ 10⁵