标签：
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
Credits:
Special thanks to @ts for adding this problem and creating all test cases.
Bit Manipulation
#include<iostream> using namespace std; class Solution { public: uint32_t reverseBits(uint32_t n) { uint32_t m=0; for(int i=0;i<32;i++){ m<<=1; m = m|(n & 1); n>>=1; } return m; } }; int main() { uint32_t n = 1; Solution sol; cout<<sol.reverseBits(n)<<endl; return 0; }
标签：
原文地址：http://www.cnblogs.com/Azhu/p/4323474.html
