class Solution {
public:
vector<int> intersection(vector<int>& nums1, vector<int>& nums2) {
set<int> record;
for(int i=0;i<nums1.size();i++)
record.insert(nums1[i]);
set<int> result;
for(int i=0;i<nums2.size();i++)
if(record.find(nums2[i])!=record.end())
result.insert(nums2[i]);
vector<int> resultVector;
for(set<int>::iterator iter=result.begin(); iter!=result.end(); iter++)
resultVector.push_back(*iter);
return resultVector;
}
};
两数组交集代码补全
最新推荐文章于 2023-08-20 23:15:00 发布