LeetCode每日一题(1769. Minimum Number of Operations to Move All Balls to Each Box)

You have n boxes. You are given a binary string boxes of length n, where boxes[i] is ‘0’ if the ith box is empty, and ‘1’ if it contains one ball.

In one operation, you can move one ball from a box to an adjacent box. Box i is adjacent to box j if abs(i - j) == 1. Note that after doing so, there may be more than one ball in some boxes.

Return an array answer of size n, where answer[i] is the minimum number of operations needed to move all the balls to the ith box.

Each answer[i] is calculated considering the initial state of the boxes.

Example 1:

Input: boxes = “110”
Output: [1,1,3]

Explanation: The answer for each box is as follows:

1. First box: you will have to move one ball from the second box to the first box in one operation.
2. Second box: you will have to move one ball from the first box to the second box in one operation.
3. Third box: you will have to move one ball from the first box to the third box in two operations, and move one ball from the second box to the third box in one operation.

Example 2:

Input: boxes = “001011”
Output: [11,8,5,4,3,4]

Constraints:

• n == boxes.length
• 1 <= n <= 2000
• boxes[i] is either ‘0’ or ‘1’.

---

假设 left[i]是 nums[i]左侧的所有的球都移动到 i 的所需步数， right[i]是 nums[i]右侧所有的球都移动到 i 的所需步数， 那这样所有球都移动到 i 的步数就是 left[i]+right[i], 而 left[i+1] = left[i] + left_count[i+1], 其中 left_count[i]是 nums[i+1]左侧的所有球的数量, 这其实说的是所用移动到 i 的球都需要再加上 1 步来移动到 i+1, 同理 right[i-1] = right[i] + right_count[i-1], 我们只需要算出 left 和 right, 然后把它们相加就是最终答案了

---

impl Solution {
    pub fn min_operations(boxes: String) -> Vec<i32> {
        let chars: Vec<char> = boxes.chars().collect();
        let mut ans = vec![0; boxes.len()];
        let mut count = 0;
        let mut steps = 0;
        for (i, c) in chars.iter().enumerate() {
            steps += count;
            ans[i] += steps;
            if c == &'1' {
                count += 1;
            }
        }
        count = 0;
        steps = 0;
        for (i, c) in chars.iter().enumerate().rev() {
            steps += count;
            ans[i] += steps;
            if c == &'1' {
                count += 1;
            }
        }
        ans
    }
}