1413. 逐步求和得到正数的最小值 代码实现(自解) 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; } };