leetcode 1409. 查询带键的排列

Problem: 1409. 查询带键的排列

考虑到实际模拟的话太耗费时间了，所以用哈希表来表示 数字-索引，然后对每个查询，拿到相应数字对应的索引ind，并且修改在索引ind前面的数字的索引都+1

Code

class Solution { public: vector<int> processQueries(vector<int>& queries, int m) { vector<int> tr(m + 1), ret; for(int i = 1; i <= m; i++) tr[i] = i-1; int n = queries.size(), a, ind; for(int i = 0; i < n; i++) { a = queries[i]; ind = tr[a]; ret.push_back(ind); for(int i = 1; i <= m; i++) { if(tr[i] < ind) tr[i]++; } tr[a] = 0; } return ret; } };