목록릿코드 문제 풀기 (1)

소프트웨어에 대한 모든 것

LeetCode 풀기 - 1413. Minimum Value to Get Positive Step by Step Sum

1413. Minimum Value to Get Positive Step by Step Sum 문제) 솔루션1) class Solution: def minStartValue(self, nums: List[int]) -> int: if nums[0] > 0: start = 1 else: start = abs(nums[0]) + 1 while True: r = start for n in nums: if r+n int: return abs(min(accumulate(nums, initial=0))) + 1
알고리즘/LeetCode 2021. 11. 12. 08:34
Prev 1 Next