LeetCode #: 53
Difficulty: Easy
Topics: Array, Divide and Conquer, Dynamic Programming.
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.
This problem is solved with Kadane's algorithm that has O(n) time complexity.
Time complexity: O(n)
Space complexity: O(1)