Minimum Moves to Equal Array Elements LeetCode solution in Java

1
class Solution {
2
  public int minMoves(int[] nums) {
3
    int min = Integer.MAX_VALUE;
4
    int count = 0;
5
    for (int i : nums) min = Math.min(i, min);
6

7
    for (int i = 0; i < nums.length; i++) {
8
      count += nums[i] - min;
9
    }
10
    return count;
11
  }
12
}