Given an array of numbers nums, in which exactly two elements appear only once and all the other elements appear exactly twice. Find the two elements that appear only once.
For example:
Given nums = [1, 2, 1, 3, 2, 5], return [3, 5].
Note:
The order of the result is not important. So in the above example, [5, 3] is also correct.
Your algorithm should run in linear runtime complexity. Could you implement it using only constant space complexity?
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 |
class Solution { public: vector<int> singleNumber(vector<int>& nums) { sort(nums.begin(), nums.end()); vector<int> v(2); int flag = 0; for(int i = 0; i < nums.size() - 1; i = i + 2) { if(nums[i] != nums[i + 1]) { v[0] = nums[i]; for(int j = i + 1; j < nums.size() - 1; j = j + 2) { if(nums[j] != nums[j + 1]) { v[1] = nums[j]; flag = 1; break; } } break; } } if(flag == 0) { v[1] = nums[nums.size() - 1]; } return v; } }; |
❤ 点击这里 -> 订阅《PAT | 蓝桥 | LeetCode学习路径 & 刷题经验》by 柳婼
❤ 点击这里 -> 订阅《从放弃C语言到使用C++刷算法的简明教程》by 柳婼
❤ 点击这里 -> 订阅PAT甲级乙级、蓝桥杯、GPLT天梯赛、LeetCode题解离线版
