Re: [闲聊] 每日leetcode

楼主: dont   2025-01-06 21:02:40
1769. Minimum Number of Operations to Move All Balls to Each Box
## 思路
分左右两次计算
每次移动1个index的移动次数 会是原本次数加上球的个数
## Code
```cpp
class Solution {
public:
vector<int> minOperations(string boxes) {
int n = boxes.size();
vector<int> res(n, 0);
int curr_sum=0, curr_ball=0;
for (int i=0; i<n; ++i) {
res[i] = curr_sum;
curr_ball += boxes[i] == '1';
curr_sum += curr_ball;
}
curr_sum=0, curr_ball=0;
for (int i=n-1; i>=0;
作者: sustainer123 (caster)   2025-01-06 21:03:00
大师 我写超丑
作者: Meaverzt (Meaverzt)   2025-01-06 21:04:00
大师 肥肥O(n)想超久才写出来

Links booklink

Contact Us: admin [ a t ] ucptt.com