new_contents: 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)
  
subject: Add py solution for 462. Minimum Moves to Equal Array Elements II