企业官网建设流程全解析

Problem: 1848. 到目标元素的最小距离

耗时100%

Code

class Solution { public: int getMinDistance(vector<int>& nums, int target, int start) { int n = nums.size(), mi = INT_MAX; for(int i = start; i < n; i++) { if(nums[i] == target) { mi = min(mi, abs(i - start)); break; } } for(int i = start - 1; i >= 0; i--) { if(nums[i] == target) { mi = min(mi, abs(i - start)); break; } } return mi; } };