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.
位运算即可。
1 class Solution { 2 public: 3 uint32_t reverseBits(uint32_t n) { 4 uint32_t answer = 0; 5 for(int i=0;i<32;i++) 6 { 7 answer = answer<<1; 8 answer = answer | (n&0x01); 9 n = n>>1; 10 } 11 return answer; 12 } 13 };
原文：http://www.cnblogs.com/Sean-le/p/4816751.html