介绍

题目链接 :https://leetcode-cn.com/problems/minimum-distance-to-the-target-element/
题解
func getMinDistance(nums []int, target int, start int) int {
left:=start
right:=start;
for left>=0 || right<=len(nums)-1 {
if left >= 0 && nums[left] == target {
return start - left
} else if right<=len(nums)-1 && nums[right] == target {
return right - start
}
left--
right++
}
return -1
}
介绍
题目链接 :https://leetcode-cn.com/problems/minimum-distance-to-the-target-element/
题解