leetcode-Single Number III
来源:互联网 发布:驱动加密软件 编辑:程序博客网 时间:2024/05/16 00:40
Difficulty:Medium
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?
class Solution {public: vector<int> singleNumber(vector<int>& nums) { if(nums.empty()) return vector<int>(); int temp=0; for(auto &e:nums) temp^=e; int i; for(i=0;i<31;++i) if(temp&(1<<i)) break; vector<int> res(2,0); for(auto &e:nums){ if(e&(1<<i)) res[0]^=e; else res[1]^=e; } return res; }};
0 0
- [LeetCode] Single Number III
- [leetcode] Single Number III
- [Leetcode]Single Number III
- [leetcode] Single Number III
- Leetcode: Single Number III
- LeetCode || Single Number III
- leetCode---Single Number III
- *LeetCode-Single Number III
- Single Number III -- leetcode
- Leetcode: Single Number III
- [LeetCode] Single Number III
- LeetCode--Single Number III
- leetcode-Single Number III
- LeetCode:Single Number III
- [LeetCode] Single Number III
- LeetCode -- Single Number III
- 【leetcode】Single Number III
- 【Leetcode】Single Number III
- dom居中
- 4、LazyInitializationException:
- AlertViewController
- 黑马程序员——JAVA基础----面向对象
- python Pexpect
- leetcode-Single Number III
- 黑马程序员—Java基础—多线程1
- Nginx Location配置指南
- solr查询 - 标准查询分析器
- 递归算法1
- python 字符串操作
- JavaScript中没有块级作用域程序举例例证
- Dynamic Programming
- JAVA面试题