maximum_subarray

README

< Previous 　　　　　　　　　　　　　　　　 Next >

53. Maximum Subarray (Easy)

Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.

Example:

Input: [-2,1,-3,4,-1,2,1,-5,4],
Output: 6
Explanation: [4,-1,2,1] has the largest sum = 6.

Follow up:

If you have figured out the O(n) solution, try coding another solution using the divide and conquer approach, which is more subtle.

Related Topics

[Array] [Divide and Conquer] [Dynamic Programming]

Similar Questions

1. Best Time to Buy and Sell Stock (Easy)
2. Maximum Product Subarray (Medium)
3. Degree of an Array (Easy)
4. Longest Turbulent Subarray (Medium)