Maximum Subarray

Medium

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
The subarray [4,-1,2,1] has the largest sum 6.
Input: nums = [1]
Output: 1
The subarray [1] has the largest sum 1.
Input: nums = [5,4,-1,7,8]
Output: 23
The subarray [5,4,-1,7,8] has the largest sum 23.
Loading...
Test Results

Run your code to see executed test cases