LeetCode:Single Number II
来源:互联网 发布:北京搬家公司 知乎 编辑:程序博客网 时间:2024/04/29 21:04
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?
class Solution: # @param A, a list of integer # @return an integer def singleNumber(self, A): l=[] x=0 minus=0 for i in range(32): l.append(0)#创建个32的列表,起始都是0 for j in A: if j<0:#负数位移有点问题,不是简单的右移,还要计算,为了简单运算,负数转正数 j=-j minus=minus+1#同时记录负数的个数,如果最后不是3的倍数,说明所求的数字是负数 for i in range(32): l[i]=l[i]+ ((j>>i)&1)#不断右移,是1的位数上加1 if l[i]==3:#是3,清零 l[i]=0 for i in range(32): if l[i]==1: x=x+2**i#通过2进制把数算出来 if minus%3!=0: x=-x#是负数? return x
0 0
- 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
- java jsp jquery json 二级联动菜单
- 南阳 290 动物统计加强版
- 灵活的JavaScript
- [MTK]LCD 调试总结
- jsp内置对象
- LeetCode:Single Number II
- stos串存储指令 以及rep重复执行指令
- 走在嘉兴
- 输入法
- 如何使用TestFlight进行Beta测试
- SFTP用密钥登陆
- MySQL存储过程,生成大量数据
- SQL年月日方面的查询信息
- 网关,DNS设置