leetcode 2295.替换数组中的元素

1.题目要求:



2.题目代码:

class Solution {
public:vector<int> arrayChange(vector<int>& nums, vector<vector<int>>& operations){map<int,int> element_index;//创建图存入元素和元素对应的下标for(int i = 0;i < nums.size();i++){element_index.insert(make_pair(nums[i],i));}//利用map容器找到数的元素和下标for(int i = 0;i < operations.size();i++){map<int,int> :: iterator it = element_index.find(operations[i][0]);//进行替换nums[it->second] = operations[i][1];//把新的元素和当前下标存入map容器中element_index.insert(make_pair(operations[i][1],it->second));//删除旧的迭代器element_index.erase(it);}return nums;}
};