Kadane's Algorithm

1export function maxSubArray(nums: number[]): number {
2  let current = nums[0];
3  let best = nums[0];
4
5  for (let i = 1; i < nums.length; i += 1) {
6    current = Math.max(nums[i], current + nums[i]);
7    best = Math.max(best, current);
8  }
9
10  return best;
11}