1769. 移动所有球到每个盒子所需的最小操作数

  1. class Solution {
  2.           public int[] minOperations(String boxes) {
  3.               if (boxes == null || boxes.length() == 0)
  4.                   return new int[0];
  6.               int[] ans = new int[boxes.length()];
  8.               for (int i = 0; i < boxes.length(); i++) {
  9.                   ans[i] = 0;
  10.                   for (int j = 0; j < boxes.length(); j++) {
  11.                       if (i != j && boxes.charAt(j) == '1')
  12.                           ans[i] += Math.abs(i - j);
  13.                   }
  15.               }
  16.               return ans;
  17.           }
  18.       }