Soal
00:00

5. Maximum Subarray

SedangPemrograman dinamisMicrosoftGoogle

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

Contoh 1:

Input: nums = [-2,1,-3,4,-1,2,1,-5,4]
Output: 6

Contoh 2:

Input: nums = [1]
Output: 1

Batasan:

  • 1 <= nums.length <= 10^5
Mode kode inti
● Tersimpan otomatisBaris 1, kolom 1