Leetcode 1413. Minimum Value to Get Positive Step by Step Sum

文章作者:Tyan
博客:noahsnail.com  |  CSDN  |  简书

1. Description

Minimum Value to Get Positive Step by Step Sum

2. Solution

  • Version 1
class Solution:
    def minStartValue(self, nums):
        min_value = nums[0]
        total = 0
        for num in nums:
            total += num
            if total < min_value:
                min_value = total
        if min_value >= 1:
            return 1
        else:
            return 1 - min_value
  • Version 2
class Solution:
    def minStartValue(self, nums):
        min_value = 0
        total = 0
        for num in nums:
            total += num
            if total < min_value:
                min_value = total
        return 1 - min_value

Reference

  1. https://leetcode.com/problems/minimum-value-to-get-positive-step-by-step-sum/
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值