Sandbox::https://github.com/JavaScriptor/leetcode/blob/master/algorithms/cpp/reverseBits/reverseBits.cpp

Repository navigation

33 lines (29 loc) · 956 Bytes

// Source : https://leetcode.com/problems/reverse-bits/

// Author : Hao Chen

// Date : 2015-03-30

/**********************************************************************************

* 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.

**********************************************************************************/

class Solution {

public:

uint32_t reverseBits(uint32_t n) {

uint32_t ret=0;

for(int i=0; i<32; i++) {

ret = (ret*2) + (n & 0x1);

n /=2 ;

}

return ret;

}

};