題庫
00:00

5. Maximum Subarray

中等動態規劃MicrosoftGoogle

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

範例 1:

輸入: nums = [-2,1,-3,4,-1,2,1,-5,4]
輸出: 6

範例 2:

輸入: nums = [1]
輸出: 1

限制條件:

  • 1 <= nums.length <= 10^5
核心程式碼模式
● 已自動儲存第 1 行,第 1 欄