Given an integer array
nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.
Explanation: [4,-1,2,1] has the largest sum = 6.
If you have figured out the O(n) solution, try coding another solution using the divide and conquer approach, which is more subtle.
Brute force solution
Divide and conquer solution
Want to know details of the Divide and conquer, check my post: Leetcode problems of Divide and conquer.