LeetCode 190. Reverse Bits
2016-04-05 03:06
375 查看
Reverse bits of a given 32 bits unsigned integer.
For example, given input 43261596 (represented in binary as 00000010100101000001111010011100), return 964176192 (represented in binary as00111001011110000010100101000000).
Follow up:
If this function is called many times, how would you optimize it?
Related problem: Reverse Integer
题目:把一个32位的unsigned integer 翻转过来
可以一位一位的移,也可以更多位的移,建立一个hash表即可,我选择的是4位4位的移
For example, given input 43261596 (represented in binary as 00000010100101000001111010011100), return 964176192 (represented in binary as00111001011110000010100101000000).
Follow up:
If this function is called many times, how would you optimize it?
Related problem: Reverse Integer
题目:把一个32位的unsigned integer 翻转过来
可以一位一位的移,也可以更多位的移,建立一个hash表即可,我选择的是4位4位的移
class Solution { public: uint32_t reverseBits(uint32_t n) { //ret用来保存返回值,assist用来辅助 uint32_t ret = 0,assist=0; //建立map,用来保存0~15对应的翻转无符号数 map<uint32_t, uint32_t> ma; ma[0] = 0;ma[1] = 8;ma[2] = 4;ma[3] = 12;ma[4] = 2;ma[5] = 10;ma[6] = 6;ma[7] = 14; ma[8] = 1;ma[9] = 9;ma[10] = 5;ma[11] = 13;ma[12] = 3;ma[13] = 11;ma[14] = 7;ma[15] = 15; //每次移4位,移7次即可 for (int i = 0;i < 7;++i) { //用来得到前4位对应的翻转数 assist = ma[n & 15ul]; ret += assist; n=n >> 4; ret=ret << 4; } assist = ma[n & 15ul]; ret += assist; return ret; } };
相关文章推荐
- Storm 准备(一)
- LeetCode 225. Implement Stack using Queues(使用队列来实现栈)
- C#实现的ReplaceFirst和ReplaceLast
- Android 获取内存、内部存储、外部存储空间大小
- lintcode-medium-Reorder List
- android的Environment类
- 用OpenInventor实现的NeHe OpenGL教程-第四十七课
- 用OpenInventor实现的NeHe OpenGL教程-第四十八课
- 用OpenInventor实现的NeHe OpenGL教程-第四十六课
- 用OpenInventor实现的NeHe OpenGL教程-第四十五课
- 用OpenInventor实现的NeHe OpenGL教程-第四十四课
- Swift学习笔记之变量与常量声明
- LeetCode 224. Basic Calculator(基本计算器)
- Java动态代理机制详解(JDK 和CGLIB,Javassist,ASM)
- django之创建第7-5-第二种传值方式(time/1232/xiaodneg)
- 静电场分析
- 软考中高项学员:2016年4月4日作业
- Android Volley完全解析(一),初识Volley的基本用法
- 用OpenInventor实现的NeHe OpenGL教程-第四十三课
- LeetCode 191. Number of 1 Bits