LeetCode 53: Maximum Subarray
Problem DescriptionGiven an integer array nums, find the subarray with the largest sum, and return its sum.Example 1Input: nums = [-2,1,-3,4,-1,2,1,-5,4] Output: 6 Explanation: The subarray [4,-1,2,1]
Problem DescriptionGiven an integer array nums, find the subarray with the largest sum, and return its sum.Example 1Input: nums = [-2,1,-3,4,-1,2,1,-5,4] Output: 6 Explanation: The subarray [4,-1,2,1]