Find All K-Distant Indices in an Array LeetCode solution in C++

1
class Solution {
2
 public:
3
  vector<int> findKDistantIndices(vector<int> &nums, int key, int k) {
4
    vector<int> v;
5
    for (int i = 0; i < nums.size(); i++) {
6
      for (int j = 0; j < nums.size(); j++) {
7
        if (abs(i - j) <= k && nums[j] == key) {
8
          v.push_back(i);
9
          break;
10
        }
11
      }
12
    }
13
    sort(v.begin(), v.end());
14
    return v;
15
  }
16
};