Please solve the programming task below using a self-contained code snippet in a markdown code block.

Given an integer array nums of size n, return the minimum number of moves required to make all array elements equal.
In one move, you can increment or decrement an element of the array by 1.
Test cases are designed so that the answer will fit in a 32-bit integer.
 
Please complete the following python code precisely:
```python
class Solution:
    def minMoves2(self, nums: List[int]) -> int:
```