赞
踩
题目链接:https://leetcode.cn/problems/single-number/
使用map比较方便
class Solution {
public:
int singleNumber(vector<int>& nums) {
map<int, int> m;
for (int i = 0; i < nums.size(); ++i) {
m[nums[i]]++;
}
for (auto i = m.begin(); i != m.end(); ++i) {
if (i->second == 1){
return i->first;
}
}
return 0;
}
};
Copyright © 2003-2013 www.wpsshop.cn 版权所有,并保留所有权利。