Given an array of integers, design an algorithm to find the maximum sum of any contiguous subarray.
For example, in the array [-2, 1, -3, 4, -1, 2, 1, -5, 4], the maximum sum of any
contiguous subarray is 6, which is the sum of the subarray [4, -1, 2, 1]
Folders and files
| Name | Name | Last commit date | ||
|---|---|---|---|---|