Maximum Subarray
Medium
Dynamic Programming
Array
Kadane's Algorithm
Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum. A subarray is a contiguous part of an array.
Examples:
Input:
[-2,1,-3,4,-1,2,1,-5,4]Output:
6Explanation: [4,-1,2,1] has the largest sum = 6.
Input:
[1]Output:
1Input:
[5,4,-1,7,8]Output:
23Constraints:
- 1 ≤ nums.length ≤ 10⁵
- -10⁴ ≤ nums[i] ≤ 10⁴
Code Editor
Loading advanced editor...
Console Output
Ready to execute
Click "Run Code" to see your output here