Single Number II
来源:互联网 发布:vb猜数游戏程序 编辑:程序博客网 时间:2024/06/08 16:20
题目:
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?
我的解法:
(1)算法思想:
本题是Single Number 的升级版(见博文《Single Number》)。先用快排算法将数组排序,然后遍历一次数组即可:对于i,如果A[i]=A[i+1],则将i加上3,否则返回A[i].
(2)代码如下:
1 0
- Single Number & Single Number II
- Single Number & Single Number II
- Single Number II - leetcode
- Leetcode: Single Number II
- Single Number II
- 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
- Single Number I & II
- LeetCode:Single Number II
- Leetcode: Single Number II
- Single Number II
- leetcode :Single Number II
- Leetcode Single Number II
- 9.Hibernate的检索策略
- Android中Bluetooth的意义和用法
- What Program Is Using Port 8080
- 跟着实例学习java多线程2-synchronized锁住的是对象还是代码
- 抽象类
- Single Number II
- 判断某个Activity是否在前台显示
- boost——入门指南
- C++预编译头文件stdafx.h作用
- C++ Primer 读后感
- VB.NET和C#之比较
- iOS 制作推送证书
- codevs2133 星际竞速
- HDU 2196 Computer (树形DP)