Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.
A subarray is a contiguous part of the array (e.g., [2, -1, 3] is a subarray of [1, 2, -1, 3, 5]).
Your solution must run in O(n) time.
A brute-force approach that checks every possible subarray is O(n²) or O(n³) and will be too slow on large inputs. Think about how to solve this in a single pass.
nums = [-2, 1, -3, 4, -1, 2, 1, -5, 4]6nums = [1]1nums = [5, 4, -1, 7, 8]231 <= nums.length <= 10^5-10^4 <= nums[i] <= 10^4Expected time complexity: O(n)Run your code to see results
Use Cmd+Enter to run