【LeetCode & 劍指offer刷題】動態規劃與貪婪法題4:42 連續子陣列的最大和(53. Maximum Subarray)
阿新 • • 發佈:2019-01-06
【LeetCode & 劍指offer 刷題筆記】目錄(持續更新中...)
53. Maximum Subarray
Given an integer array nums , find the contiguous subarray (containing at least one number) which has the largest sum and return its sum. Example: Input: