leetcode

0 class Solution {

1 public:

2 vector<int> arrayChange(vector<int> &nums, const vector<vector<int>> &operations) const {

3 static int position[1000001];

4

5 for (int i = 0; i < nums.size(); i++) {

6 position[nums[i]] = i;

7 }

8

9 for (const auto &op : operations) {

10 nums[position[op[0]]] = op[1];

11 position[op[1]] = position[op[0]];

12 }

13

14 return nums;

15 }

16 }