leetcode

0 class Solution {

1 public:

2 vector<int> processQueries(const vector<int> &queries, int m) {

3 vector<int> vec(m), res;

4 res.reserve(queries.size());

5 iota(vec.begin(), vec.end(), 1);

6 for (const int query : queries) {

7 int i = 0, tmp = query;

8 while (vec[i] != query)

9 swap(tmp, vec[i++]);

10 vec[i] = tmp;

11 res.push_back(i);

12 }

13 return res;

14 }

15 };