1
class Solution {
2
  public int findMinMoves(int[] machines) {
3
    int avg = 0;
4

5
    for (int i = 0; i < machines.length; i++) {
6
      avg += machines[i];
7
    }
8

9
    if (avg % machines.length != 0) {
10
      return -1;
11
    }
12

13
    int res = 0, cnt = 0;
14
    avg = avg / machines.length;
15
    for (int m : machines) {
16
      cnt += m - avg;
17
      res = Math.max(res, Math.max(Math.abs(cnt), m - avg));
18
    }
19
    return res;
20
  }
21
}