53. Maximum Subarray

catepk·2021년 8월 28일
0

LeetCode

목록 보기
86/88
post-thumbnail

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.

A subarray is a contiguous part of an array.

Example 1:

Input: nums = [-2,1,-3,4,-1,2,1,-5,4]
Output: 6
Explanation: [4,-1,2,1] has the largest sum = 6.

Example 2:

Input: nums = [1]
Output: 1

Example 3:

Input: nums = [5,4,-1,7,8]
Output: 23

Constraints:

1 <= nums.length <= 3 * 10^4
-10^5 <= nums[i] <= 10^5

풀이

-----kadane's algorithm-----

class Solution:
    def maxSubArray(self, nums: List[int]) -> int:
        largest = -sys.maxsize
        current = 0
        for num in nums:
            current = max(num, current + num)
            largest = max(largest, current)
        return largest
profile
hello

0개의 댓글