LeetCode 137. Single Number II
来源:互联网 发布:世界地图销售网络下载 编辑:程序博客网 时间:2024/05/17 07:41
Given an array of integers, every element appears three times except for one. Find that single one.
Note:
Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory?
Solve it according to bits of different position, we thus need to verify the 32 bits. (suppose it is a 32-bit machine)
int singleNumber(vector<int>& nums) { int target = 0; for(int i = 0; i <= 31; ++i) { int count = 0; for(int j = 0; j < nums.size(); ++j) { count = count + ((nums[j] >> i) & 0x1); } target = target | ((count % 3) << i); } return target;}
Time Complexity is 32O(n). It can pass leetCode, not sure whether this is the most optimized solution though.
0 0
- [LeetCode]*137.Single Number II
- LeetCode 137. Single Number II
- [Leetcode] 137. Single Number II
- Leetcode 137. Single Number II
- Leetcode - 137. Single Number II
- 【LeetCode】137. Single Number II
- 137. Single Number II LeetCode
- [LeetCode]137. Single Number II
- [LeetCode]137. Single Number II
- LeetCode 137. Single Number II
- LeetCode *** 137. Single Number II
- [LeetCode]137. Single Number II
- leetcode 137. Single Number II
- LeetCode 137. Single Number II
- LeetCode - 137. Single Number II
- 137. Single Number II LeetCode
- LeetCode 137. Single Number II
- [leetcode] 137. Single Number II
- poj 1659
- 实习总结02
- c++第三次上机作业-计算分段函数
- 覆盖Object类的equals、hashCode和toString方法
- 服务器开发需要的知识提纲
- LeetCode 137. Single Number II
- C++常见的几个库函数详解
- ORA-19698: /home/xxx/xxx/redo01.log is from different database
- FeatureLayer,FeatureDataset,FeatureClass,Feature,IFeatureCursor几个概念总结
- 基于AttenceTimelineCell的时间轴
- #6JAVA异常处理方案#
- Windows下安装Resin配置
- jsp不能显示中文的问题
- ArcEngine属性条件查询和空间条件查询