Reverse Bits

Reverse bits of a given 32 bits unsigned integer.

For example, given input 43261596 (represented in binary as 00000010100101000001111010011100), return 964176192 (represented in binary as 00111001011110000010100101000000).

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.

---

其他人的解法：https://leetcode.com/discuss/questions/oj/reverse-bits?sort=hot

---

public class Solution 
{
    // you need treat n as an unsigned value
    public static int reverseBits(int n) 
    {
        int m=0;
        for(int i=0;i<32;i++)
        {
            m=m<<1;
            m=m|(n&1);
            n=n>>1;
        }
        return m;
    }
    public static void main(String args[])
    {
        System.out.println(reverseBits(43261596));
    }
}