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

Given an integer array nums (0-indexed) and two integers target and start, find an index i such that nums[i] == target and abs(i - start) is minimized. Note that abs(x) is the absolute value of x.
Return abs(i - start).
It is guaranteed that target exists in nums.
 
Please complete the following python code precisely:
```python
class Solution:
    def getMinDistance(self, nums: List[int], target: int, start: int) -> int:
```