Single Number III
来源:互联网 发布:创邦网络 编辑:程序博客网 时间:2024/06/13 22:06
iven 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?
class Solution {public: vector<int> singleNumber(vector<int>& nums) { vector<int> result; int n = nums.size(); int a = 0; for (int i = 0; i < n; i++) { a ^= nums[i]; } int b = 1; while ((b&a) == 0) { b <<= 1; } int c = 0; int d = 0; for (int i = 0; i < n; i++) { if ((nums[i]&b) != 0) { c ^= nums[i]; } else { d ^= nums[i]; } } result.push_back(c); result.push_back(d); return result; }};
0 0
- Single Number III
- Single Number III
- [LeetCode] Single Number III
- [leetcode] Single Number III
- 260 Single Number III
- [Leetcode]Single Number III
- [leetcode] Single Number III
- Leetcode: Single Number III
- 260 Single Number III
- LeetCode || Single Number III
- Single Number III
- Single Number III
- Single Number III
- [刷题]Single Number III
- Single Number III
- Leetcode75: Single Number III
- leetCode---Single Number III
- *LeetCode-Single Number III
- 【POJ】[2524]Ubiquitous Religions
- 计算机网络-UDP协议
- Web Service 与 WCF 的区别
- 怎么写出靠谱的简历
- C语言学习笔记 内存访问符号
- Single Number III
- 2016年1月份 英语新的起点
- 把网站提交到网站分类目录有效排名
- 内核初始化-从start_kernel到init
- 黑马程序员——Java多线程
- Linux命令行学习之路(三)
- C 结构体使用汇总
- 数据结构实践——顺序表应用
- JVM内存管理机制