You have `n`

boxes. You are given a binary string `boxes`

of length `n`

, where `boxes[i]`

is `'0'`

if the `i`

box is ^{th}**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 `i`

box.^{th}

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'`

.

```
struct Solution;
impl Solution {
fn min_operations(boxes: String) -> Vec<i32> {
let n = boxes.len();
let boxes: Vec<bool> = boxes.chars().map(|c| c == '1').collect();
let mut left = vec![0; n];
let mut right = vec![0; n];
let mut prev = 0;
for i in 0..n {
left[i] += prev;
if i > 0 {
left[i] += left[i - 1];
}
if boxes[i] {
prev += 1;
}
}
prev = 0;
for i in (0..n).rev() {
right[i] += prev;
if i + 1 < n {
right[i] += right[i + 1];
}
if boxes[i] {
prev += 1;
}
}
let mut res = vec![0; n];
for i in 0..n {
res[i] = left[i] + right[i];
}
res
}
}
#[test]
fn test() {
let boxes = "110".to_string();
let res = vec![1, 1, 3];
assert_eq!(Solution::min_operations(boxes), res);
let boxes = "001011".to_string();
let res = vec![11, 8, 5, 4, 3, 4];
assert_eq!(Solution::min_operations(boxes), res);
}
```