class Solution(object):
    def minMoves2(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        nums.sort()
        median = nums[len(nums) / 2]
        return sum(abs(x - median) for x in nums)

Add py solution for 462. Minimum Moves to Equal Array Elements II
Add py solution for 462. Minimum Moves to Equal Array Elements II

462. Minimum Moves to Equal Array Elements II: https://leetcode.com/problems/minimum-moves-to-equal-array-elements-ii/

Could be optimized to O(n) by q-select
