Leetcode 190. Reverse Bits

190. 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 as00111001011110000010100101000000).

Follow up:
If this function is called many times, how would you optimize it?

analysis, get the last bit and move the result left for one bit and add the bit to the last bit of the result.

Code

public class Solution {
    // you need treat n as an unsigned value
    public int reverseBits(int n) {
      //I can do a while loop, and use move to get the number of this bit.
      //And then also use the loop to move the position to get the number of other corresponding bit, and exchange the two bits
      int result = 0;
      for(int i = 0; i < 32;i++){
        if(n & 1 == 1)
        result = (result<< 1) + 1;
        else
        result = result<< 1;
        n = n >>1;
      }
      return result;
    }
}