[LeetCode] Single Number II
来源:互联网 发布:linux奶瓶破解wifi 编辑:程序博客网 时间:2024/06/11 10:36
Single Number II
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?
比较坑的是提交几次发现 符号位老是丢掉,不明所以,后来发现是
const int MASK 这行出现了问题, 应该是 const unsigned int MASK,然后就好了。
class Solution {public: int singleNumber(int A[], int n) { // Note: The Solution object is instantiated only once and is reused by each test case. assert(A&&n>0&&(n-1)%3==0); unsigned int ans=0; for(int i=0;i<32;i++) { const unsigned int MASK=(1<<i); int t=0; for(int j=0;j<n;j++) t+=(A[j]&MASK)>0?1:0; ans|=(t%3==0)?0:MASK; } return (int)ans; }};
- Single Number II - leetcode
- Leetcode: Single Number II
- [LeetCode] Single Number II
- LeetCode: Single Number II
- leetcode -- Single Number II
- [leetcode]Single Number II
- [LeetCode] Single Number II
- 【leetcode】Single Number II
- LeetCode:Single Number II
- Leetcode: Single Number II
- leetcode :Single Number II
- Leetcode Single Number II
- [LeetCode]Single Number II
- leetcode: Single Number (II)
- leetcode Single Number II
- leetcode Single Number II
- [LeetCode],Single Number II
- LeetCode | Single Number II
- Uva 674 背包
- 2013年国庆记事
- 闪回技术之闪回事物查询特别篇4
- 使用的Ubuntu系统信息
- Android中JSON数据处理
- [LeetCode] Single Number II
- ubuntu12.04:apt-get 依赖版本过高( Depends: binutils-msp430 (>= 2.21~) but it is not going to be )
- 从后台读取数据方法
- 滚动条位置
- 一棵排序二叉树,令 f=(最大值+最小值)/2, 设计一个算法,找出距离f 值最近、大于f 值的结点。 复杂度如果是O(n2)则不得分
- 升级NSIS3.0a0后调用dll出错:“发生意外,尝试运行*时出错“-解决方法:修改system调用函数时的参数类型
- 『开源』字符串匹配引擎
- T_SQL备份数据库
- Android中shape的使用