package leetcode;

/**
 * https://leetcode.com/problems/minimum-moves-to-equal-array-elements/
 */
public class Problem453 {
    public int minMoves(int[] nums) {
        // TODO
        return 0;
    }

    public static void main(String[] args) {
        Problem453 prob = new Problem453();
        System.out.println(prob.minMoves(new int[]{1, 2, 3})); // 3
    }
}

@@ -354,16 +354,159 @@
 ); // 3%0A
+        System.out.println(prob.minMoves(new int%5B%5D%7B1, 2, 3%7D)); // 6%0A        System.out.println(prob.minMoves(new int%5B%5D%7B1, 2, 3, 4, 5%7D)); // 10%0A
     %7D%0A%7D%0A

Update problem 453