Minimum Moves to Equal Array Elements

https://www.lintcode.com/problem/minimum-moves-to-equal-array-elements/description

public class Solution {
    /**
     * @param nums: an array
     * @return: the minimum number of moves required to make all array elements equal
     */
    public int minMoves(int[] nums) {
        // Write your code here
//        每次把n-1个+1，可以看成1个-1
        int min = Integer.MAX_VALUE;
        for (int i = 0; i < nums.length; i++) {
            int num = nums[i];
            min = Math.min(num, min);
        }
        int res = 0;
        for (int i = 0; i < nums.length; i++) {
            int num = nums[i];
            res += num - min;
        }
        return res;
    }
}