Minimum Moves to Equal Array Elements II LeetCode solution in Python

1
class Solution:
2
    def minMoves2(self, nums: List[int]) -> int:
3

4
        n = len(nums)
5
        nums.sort()
6

7
        if n % 2 == 1:
8
            median = nums[n // 2]
9
        else:
10
            median = (nums[n // 2 - 1] + nums[n // 2]) // 2
11

12
        ans = 0
13

14
        for val in nums:
15
            ans += abs(val - median)
16

17
        return ans