Skip to content
6
0
:
0
0

Signal Strength Burst

Hard

Dynamic Programming

In "Signal Strength Burst", each integer represents gain or loss at each time step.

Find the maximum possible sum of a contiguous non-empty segment.

Example 1

Input:nums = [-2,6,-1,7,-3,8]
Output:17

For input nums = [-2,6,-1,7,-3,8], the contiguous subarray [6,-1,7,-3,8] gives the maximum sum 17. Therefore, return 17.

Example 2

Input:nums = [6,-1,-2,10,-1,2]
Output:14

For input nums = [6,-1,-2,10,-1,2], the contiguous subarray [6,-1,-2,10,-1,2] gives the maximum sum 14. Therefore, return 14.

Constraints

  • 1 <= nums.length <= 105
  • -104 <= nums[i] <= 104
solution.js
Loading...

Test Cases (2)

Test Case 1
Input:
[-2,6,-1,7,-3,8]
Expected Output:
17
Test Case 2
Input:
[6,-1,-2,10,-1,2]
Expected Output:
14