LeetCode260——Single Number III精彩解法
来源:互联网 发布:天猫关键词优化 编辑:程序博客网 时间:2024/06/05 21:04
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?
Credits:
实现:
class Solution {
public:
vector<int> singleNumber(vector<int>& nums) {
int ax = 0;
int a=0, b = 0;
for (int item : nums) {
ax ^= item;
}
int lastb = (ax & (ax-1)) ^ ax;
for (int item : nums) {
if (item & lastb) {
a ^= item;
} else {
b ^= item;
}
}
return vector<int>{a, b};
}
};
0 0
- LeetCode260——Single Number III精彩解法
- Leetcode260 Single Number III
- leetcode260-single number iii
- leetcode260. Single Number III
- leetcode260. Single Number III
- leetcode260 Single Number III java
- Single Number III问题及解法
- LeetCode——Single Number III
- leetcode——Single Number III
- LeetCode—260 Single Number III
- leetcode——260——Single Number III
- 字符串算法——单一数(Single Number III)
- Single Number III
- Single Number III
- [LeetCode] Single Number III
- [leetcode] Single Number III
- 260 Single Number III
- [Leetcode]Single Number III
- 由猜拳习惯看出你的性格
- CSS文档流与块级元素(block)、内联元素(inline)
- The Suspects
- USACO 2.1 Hamming Codes (递归)
- Ubiquitous Religions
- LeetCode260——Single Number III精彩解法
- 什么是块级元素和内联级元素
- 《树的枚举》的理解
- Java Swing编程:JTable表格
- Find them, Catch them
- 了解"DevOps"
- 欢迎使用CSDN-markdown编辑器
- 开始的标记_2015年10月1日00:05:59
- 【密码学】生成8位26个字母和数字的全排列(密码字典,密钥)c++代码(非递归高效直接)