Steward

分享是一種喜悅、更是一種幸福

程式語言 - LeetCode - C++ - 1848. Minimum Distance to the Target Element

---

題目：


解答：

class Solution {
public:
    int getMinDistance(vector<int>& nums, int target, int start) {
        int ans = INT_MAX;

        for (int i = 0; i < nums.size(); ++i) {
            if (nums[i] == target) {
                ans = min(ans, abs(i - start));
            }
        }

        return ans;
    }
};