BiruLyu
6/3/2017 - 1:24 AM

462. Minimum Moves to Equal Array Elements II.java

class Solution(object):
    def minMoves2(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        if not nums :
            return 0
        nums.sort()
        start = 0
        end = len(nums) - 1
        res = 0
        while start < end : 
            res += nums[end] - nums[start]
            start += 1
            end -= 1
        return res
public class Solution {
    public int minMoves2(int[] nums) {
        int res = 0;
        if(nums == null || nums.length <= 1) return res;
        int start = 0;
        int end = nums.length - 1;
        Arrays.sort(nums);
        while(start < end) {
            res += nums[end] - nums[start];
            start++;
            end--;
        }
        return res;
    }
}