首页 > 其他 > 详细

137. Single Number II

时间:2016-04-21 09:54:18      阅读:264      评论: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
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!