Minimum Distance to the Target Element LeetCode solution in Python

1
class Solution:
2
    def getMinDistance(self, nums: List[int], target: int, start: int) -> int:
3
        if nums[start] == target:
4
            return 0
5
        left, right = start - 1, start + 1
6
        N = len(nums)
7
        while True:
8
            if left >= 0 and nums[left] == target:
9
                return start - left
10
            if right < N and nums[right] == target:
11
                return right - start
12
            left -= 1
13
            right += 1