/**
  Problem Name : Minimum Number of Operations to Move All Balls to Each Box
  Problem URL : https://leetcode.com/problems/minimum-number-of-operations-to-move-all-balls-to-each-box/
  Description :
    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.
  Difficulty : Medium
  Language : C#
  Category : Algorithms
*/
public class Solution 
{
    public int[] MinOperations(string boxes) 
    {
        int [] ans = new int[boxes.Length];
        
        for(int i = 0; i < boxes.Length; i++)
            for(int j = 0; j < boxes.Length; j++)
                if(i != j && boxes[j] == '1')
                    ans[i] += Math.Abs(i - j);
        
        return ans;
    }
}