Posts Tagged 【bit】Reverse Bits

Reverse Bits

  Total Accepted: 17853  Total Submissions: 64347 My Submissions

Question  Solution 

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.

public class Solution {
    // you need treat n as an unsigned value
    public int reverseBits(int n) {
        int sum = 0;
        for(int i= 0;i<32;i++) {
            if((n&1) == 1) {
                sum = (sum << 1) + 1;
                n = n >> 1;
            }
            else {
                sum = (sum << 1); 
                n = n >> 1;
            }
        }
        return sum;
    }
}

Note:对于高精度计算，在题目中不宜12 * Math.pow(10,-1) == 1.2000000000000002

Have you met this question in a real interview?