Minimum Distance to the Target Element LeetCode solution in C++

1
class Solution {
2
 public:
3
  int getMinDistance(vector<int> &nums, int target, int start) {
4
    int ans = INT_MAX;
5
    for (int i = 0; i < nums.size(); i++) {
6
      int temp = 0;
7
      if (nums[i] == target) {
8
        temp = abs(i - start);
9
        if (temp < ans) {
10
          ans = temp;
11
        }
12
      }
13
    }
14
    return ans;
15
  }
16
};