Leetcode - Maximum Subarray

Question

Given an integer array nums, find the with the largest sum, and return its sum.

Ideas

• This is exactly the use of the Maximum Subarray Sum problem and Kadane’s Algorithm

Solution