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
1 public class Solution { 2 // you need treat n as an unsigned value 3 public int reverseBits(int n) { 4 int result = 0; 5 for(int i = 1; i <= 32; i++){ 6 int lowest = n & 1; 7 n >>= 1; 8 result <<= 1; 9 result |= lowest; 10 }//for 11 12 return result; 13 } 14 }
原文：http://www.cnblogs.com/luckygxf/p/4323158.html