←Back

Maximum Subarray

Medium

Description

Given an integer array nums, find the subarray with the largest sum, and return *its sum*. The test cases are generated so that the answer will fit in a 32-bit integer.

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 6.
Example 2:
Input: nums = [1]
Output: 1
Example 3:
Input: nums = [5,4,-1,7,8]
Output: 23

Constraints

  • 1 <= nums.length <= 10^5
  • -10^4 <= nums[i] <= 10^4
ArrayDivide and ConquerDynamic Programming
solution.jsJavaScript (Node.js)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50

Console

Test Results
▶️

Run your code to see results