class Solution {
public int getMinDistance(int[] nums, int target, int start) {
int min = Integer.MAX_VALUE;
for (int i = 0; i < nums.length; i++){
if (nums[i] == target){
min = Math.min(min, Math.abs(i - start));
}
}
return min;
}
}
力扣:1848. 到目标元素的最小距离
于 2022-08-11 23:03:46 首次发布