徐子尧的博客

LeetCode 53. Maximum SubarrayDescriptionFind the contiguous subarray within an array (containing at least one number) which has the largest sum.For example, given the array [-2,1,-3,4,-1,2,1,-5,4], th