Daily LeetCode – day0126 1769. Minimum Number of Operations to Move All Balls to Each Box

// 1769. Minimum Number of Operations to Move All Balls to Each Box
class Solution {
    public int[] minOperations(String boxes) {
        char[] charArray = boxes.toCharArray();
        int n = charArray.length;
        int[] ans = new int[n];
        for (int i = 0; i < n; ++i) {
            int c = charArray[i] - 48;
            for (int j = 0; j < n; ++j) {
                ans[j] += Math.abs(i - j) * c;
            }
        }
        return ans;
    }
}

学习笔记：
这是一道中等题，也没啥特别的算法分类。
这道题似乎没有啥特别的难点，就是双重循环计算然后把结果返回。