思路：用两个map分别存储两个列表内容，然后再对照即可classSolution{public:vector<int>findIntersectionValues(vector<int>&nums1,vector<int>&nums2){unordered_map<int,int>mp1;unordered_map<int,int>mp2;