力扣287.寻找重复数
class Solution {
public:
int findDuplicate(vector<int>& nums) {
unordered_map<int,int>umap;
int result=0;
for(int i=0;i<nums.size();++i)
{
umap[nums[i]]++;
}
for(auto it= umap.begin();it != umap.end();++it )
{
if( it ->second >= 2)
{
result=it->first;
}
}
return result;
}
};
- unordered_map unordered mapunordered_map unordered_map unordered map unordered unordered_set unordered_map set unordered_map unordered hack map tuples unordered_map map unordered unordered unordered_map unordered_set map map hash_map hash unordered_map unordered_map unordered数字map 查询表unordered_map unordered性能 unorder_map