1
class Solution {
2
public:
3
vector<int> processQueries(vector<int> &queries, int m) {
4
vector<int> p;
5

6
for (int i = 0; i < m; i++) p.push_back(m - i);
7

8
for (int i = 0; i < queries.size(); i++) {
9
auto it = find(p.begin(), p.end(), queries[i]);
10
int j = it - p.begin();
11
int tmp = p[j];
12
p.erase(it);
13
p.push_back(tmp);
14
queries[i] = m - j - 1;
15
}
16
return queries;
17
}
18
};

0

WPM •0 •0

100%

ACC •0 •0

0s

TIME •0