class Solution {
public:
int singleNumber(vector<int>& nums) {
set<int64_t> s;
int64_t temp = 0;
for(int i = 0; i < nums.size(); i++)
{
temp += nums[i];
}
for(int i = 0; i < nums.size(); i++)
{
s.insert(nums[i]);
}
int64_t res = 0;
for(auto it = s.begin(); it != s.end(); it++)
{
res += (int64_t)(*it);
}
return ((int64_t)(res * 3) - temp) / 2;
}
};
leetcode | 面试题56 - II. 数组中数字出现的次数 II
最新推荐文章于 2024-09-11 22:37:03 发布