码迷,mamicode.com
首页 > 其他好文 > 详细

137. Single Number II

时间:2016-04-21 09:57:25      阅读:120      评论:0      收藏:0      [点我收藏+]

标签:

Given an array of integers, every element appears three times except for one. Find that single one.

Similar: 136. Single Number

260. Single Number III

 1 public class Solution {
 2     public int singleNumber(int[] nums) {
 3         int onece = 0, twice = 0, xthree = 0;
 4         for (int i = 0; i < nums.length; i++) {
 5             twice |= onece & nums[i];
 6             onece ^= nums[i];
 7             
 8             xthree = ~(onece & twice);
 9             onece &= xthree;
10             twice &= xthree;
11         }
12         return (onece | twice);
13     }
14 }

 

137. Single Number II

标签:

原文地址:http://www.cnblogs.com/joycelee/p/5415547.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!