首页 > 代码库 > [leetcode-137-Single Number II]
[leetcode-137-Single Number II]
Given an array of integers, every element appears three times except for one, which appears exactly once. Find that single one.
Note:
Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory?
思路：
没有。。。看参考吧。。。。
int singleNumber(vector<int>& nums) { int result = 0; for (int i = 0; i < 32;i++) { int count = 0, bit = 1 << i; for (int j = 0; j < nums.size();j++) { if (nums[j] & bit) count++; } if (count % 3 !=0) result |= bit; } return result; }
参考：
http://www.cnblogs.com/higerzhang/p/4159330.html
[leetcode-137-Single Number II]
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。