Given an integer array nums, find the subarray with the largest sum, and return its sum.
Example 1:
Input: nums = [-2,1,-3,4,-1,2,1,-5,4]
Output: 6
Explanation: The subarray [4,-1,2,1] has the largest sum 6.
Example 2:
Input: nums = [1]
Output: 1
Explanation: The subarray [1] has the largest sum 1.
Example 3:
Input: nums = [5,4,-1,7,8]
Output: 23
Explanation: The subarray [5,4,-1,7,8] has the largest sum 23.
def maxSubArray(self, nums: List[int]) -> int:
tempMax = nums[0]
finalMax = nums[0]
for i in range(1, len(nums)):
tempMax = max(nums[i],tempMax+nums[i])
finalMax = max(tempMax,finalMax)
return finalMax
'LEETCODE' 카테고리의 다른 글
| #62. Unique Paths (1) | 2023.11.01 |
|---|---|
| #55. Jump Game (0) | 2023.11.01 |
| #34. Find First and Last Position of Element in Sorted Array (0) | 2023.11.01 |
| #13. Roman to Integer (0) | 2023.10.19 |
| #2. Add Two Numbers (0) | 2023.10.19 |