Algorithm
Minimum Distance to the Target Element
Solution
class Solution:
def getMinDistance(self, nums: List[int], target: int, start: int) -> int:
res = len(nums)
for i, num in enumerate(nums):
if num == target:
res = min(res, abs(i - start))
return resVideo GuideLeetcode Daily
Time Complexity
O(n)
Space Complexity
O(1)
