leetcode：Single Number II
2014-06-15 00:39
344 查看
给出一个一组数组，除了特殊的一个外，里面的数字都出现了三次，
不使用额外的空间
public class Solution {
public int singleNumber(int[] A) {
int one = 0, two = 0, three = 0;
for(int i = 0; i < A.length; ++i){
two |= one & A[i];
one ^= A[i];
three = ~(one & two);
one &= three;
two &= three;
}
return one;
}
}
转载之http://www.cnblogs.com/x1957/p/3373994.html
不使用额外的空间
public class Solution {
public int singleNumber(int[] A) {
int one = 0, two = 0, three = 0;
for(int i = 0; i < A.length; ++i){
two |= one & A[i];
one ^= A[i];
three = ~(one & two);
one &= three;
two &= three;
}
return one;
}
}
转载之http://www.cnblogs.com/x1957/p/3373994.html
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- LeetCode_Single Number II
- [LeetCode] Single Number II
- 【leetcode】Single Number II
- 【LeetCode】SingleNumberII_137
- Leetcode: Single Number II
- Leetcode - Single Number II
- LeetCode解题报告—— Sum Root to Leaf Numbers & Surrounded Regions & Single Number II
- LeetCode Single Number II 单元素2
- leetcode-Single Number II
- [leetcode] Single Number II
- leetcode——137—— Single Number II
- Leetcode-single-number-ii
- [Leetcode]Single Number I&II
- leetcode:Single Number II
- Leetcode- Single Number II
- LeetCode--single-number-ii
- 【leetcode78】Single Number II
- Leetcode---Single Number I & II
- [leetcode][hash] Single Number II
- leetcode 137 —— Single Number II