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

You are given an integer array nums. In one move, you can pick an index i where 0 <= i < nums.length and increment nums[i] by 1.
Return the minimum number of moves to make every value in nums unique.
The test cases are generated so that the answer fits in a 32-bit integer.
 
Please complete the following python code precisely:
```python
class Solution:
    def minIncrementForUnique(self, nums: List[int]) -> int:
```