[leetcode] Reverse Bits

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.

 class Solution

 {

 public:

   uint32_t reverseBits(uint32_t n)

   {

     int A[] = {};

     int i = ;

     while(n > )

     {

       A[i++] = n % ;

       n /= ;

     }

     int sum = ;

     for(i = ; i < ; i++)

       sum = sum *  + A[i]; 

     return sum;

   }

 };

巴特西

[leetcode] Reverse Bits

Reverse Bits

最新文章

热门文章