[LeetCode OJ] Single Number II
2014-08-31 06:19
387 查看
题目地址:https://oj.leetcode.com/problems/single-number-ii/
题意:找出唯一一个不重复三次的数
解题思路:这题没O(N)的思路,就参考了晚上的答案
http://www.tuicool.com/articles/fAZZv2a
题意:找出唯一一个不重复三次的数
解题思路:这题没O(N)的思路,就参考了晚上的答案
http://www.tuicool.com/articles/fAZZv2a
class Solution { public: int singleNumber(int A[], int n) { int one=0,two=0,three=0; for(int i = 0; i<n; ++i){ two |= one&A[i]; one ^= A[i]; three = one&two; one &=~three; two &=~three; } return one; } };
相关文章推荐
- 【LEETCODE OJ】Single Number II
- LeetCode OJ : Single Number II
- [LeetCode OJ]Single number II
- LeetCode OJ-- Single Number II **@
- LeetCode OJ - Single Number II
- 【LeetCode OJ】Single Number II
- LeetCode OJ——Single Number II
- LeetCode OJ平台上Single Number II题目使用java位运算解决
- LeetCode OJ--Single Number II **
- LeetCode OJ:Single NumberII
- LeetCode: Single Number I && II
- 【Leetcode】Single Number II
- 【leetcode】【137】Single Number II
- leetcode_137题——Single Number II(位运算)
- 137 Single Number II(找唯一数Medium)
- 位运算-Single Number II(给定一个数组,除了一个数字出现一次,其他都出现三次,求出现一次的数)
- LeetCode Single Number I & II
- LeetCode——Single Number II
- [LeetCode] Single Number II
- Single Number II问题及解法