用了两次for循环，算是暴力解了，看别人的标准解法是用哈希表
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
| class Solution {
public:
vector<int> recoverOrder(vector<int>& order, vector<int>& friends) {
int j = 0;
int k = 0;
for(int i = 0; i<order.size(); i++){
for(int j = 0; j<friends.size(); j++){
if(order[i]==friends[j]){
int x = friends[j];
friends[j] = friends[k];
friends[k] = x;
k++;
}
}
}
return friends;
}
};©leetcode
|
