Single Number I & II
来源:互联网 发布:arm linux gcc官网 编辑:程序博客网 时间:2024/04/29 08:15
Single Number
Given an array of integers, every element appears twice except for one. Find that single one.
Note:
Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory?
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?
如果我自己想的话,大概想不出来这两道题该如何做,感觉自己还需要更宽广的思维...
这两道题的核心思想就是利用二进制的性质,将每一个数都拆成二进制位来计数.
Single Number
class Solution {public: int singleNumber(int A[], int n) { int res = 0; for(int i = 0; i < n; i++) { res ^= A[i]; } return res; }};
Single Number II
class Solution {public: int singleNumber(int A[], int n) { int bit[32]; for(int i = 0; i < 32; i++) { bit[i] = 0; } for(int i = 0; i < n; i++) { for(int j = 0; j < 32; j++) { bit[j] += (A[i] >> j) & 1; } } int res = 0; for(int i = 0; i < 32; i++) { bit[i] %= 3; res += (bit[i] > 0 ? 1 : 0) << i; } return res; }};
0 0
- Single Number I & II
- Single Number I & II
- Single Number I & II
- Single Number I & II
- [Leetcode] Single Number I | Single Number II
- LeetCode:Single Number I && II
- LeetCode Single Number I & II
- [Leetcode]Single Number I&II
- SINGLE NUMBER I & II & III
- Single Number I II III
- Single Number I+II+III
- 137. Single Number I,II
- Single Number (I II III)
- LeetCode题解:Single Number I and II
- leetcode136:single number I&II 及拓展
- LeetCode(136)(137) Single Number I II
- Bit Manipulation - Single Number I, II, III
- LeetCode(41) Single Number I 和 II
- c#开发WinCE程序之sqlce安装
- Apache Mina的SSL连接API
- 【LeetCode】Evaluate Reverse Polish Notation
- SQL语言分类
- Ubuntu“无法解析或打开软件包的列表或是状态文件”的解决办法。
- Single Number I & II
- 读《黑客与画家》
- Mat,图像的新容器
- maven项目的坐标和依赖
- Multiple markers at this line - The type java.lang.String cannot be resolved.
- 推荐java书籍
- 【leetcode】 Best Time to Buy and Sell Stock III
- OpenCV Mat类详解
- 二分查找算法