首页 > 代码库 > [LeetCode]137 Single Number II
[LeetCode]137 Single Number II
https://oj.leetcode.com/problems/single-number-ii/
http://blog.csdn.net/linhuanmars/article/details/22645599
public class Solution { public int singleNumber(int[] A) { return singleNumber_BitCompare(A, 3); } private int singleNumber_BitCompare(int[] A, int k) { int toReturn = 0; for (int i = 0 ; i < 32 ; i ++) { int tocompare = 1 << i; int occur = 0; for (int num : A) { if ((num & tocompare) != 0) // use != 0 rather than ==1 occur ++; } if (occur % k == 1) // normally it would be 0 toReturn |= tocompare; } return toReturn; } }
[LeetCode]137 Single Number II
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。