当前位置：网站首页>365 days challenge LeetCode1000 questions - Day 052 Step by step summation to get the minimum value of positive numbers Greedy

365 days challenge LeetCode1000 questions - Day 052 Step by step summation to get the minimum value of positive numbers Greedy

2022-08-10 01:47:00 【ShowM3TheCode】

1413. Step-by-step summation to get the smallest positive number

insert image description here

Code implementation (self-solving)

class Solution {public:int minStartValue(vector<int>& nums) {int sum = 0;int ans = 1;for (int& num : nums) {sum += num;ans = max(ans, 1 - sum);}return ans;}};
原网站

版权声明
本文为[ShowM3TheCode]所创，转载请带上原文链接，感谢
https://yzsam.com/2022/222/202208092344362915.html

边栏推荐

猜你喜欢

随机推荐