728x90
반응형
[LeetCode - Daily Challenge] 1413. Minimum Value to Get Positive Step by Step Sum

소스 코드는 여기 있습니다. 문제는 여기 있습니다. Problem Given an array of integers nums, you start with an initial positive value startValue. In each iteration, you calculate the step by step sum of startValue plus elements in nums (from left to right). Return the minimum positive value of startValue such that the step by step sum is never less than 1. Example 1: Input: nums = [-3,2,-3,4,2] Output: 5 Explanation: ..
Algorithm/LeetCode Daily Challenge 2021. 11. 12. 10:30
728x90
반응형
1