class Solution {
public:
int singleNumber(vector<int>& nums)
{
int len = nums.size();
if(len == 1)
return nums[0];
sort(nums.begin(),nums.end());
int i = 0;
while (i < len)
{
if( i+1< len && nums[i] == nums[i+1])
i=i+3;
else
return nums[i];
}
}
};
Single Number II
最新推荐文章于 2022-07-02 13:41:47 发布