By

文章目录

LeetCode地址：https://leetcode.com/problems/number-of-1-bits/

Problem:
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?

思路

  • 输入数据向右移取最低位，结果变量与最低位进行或操作，再向左移
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
class Solution {
public:
    uint32_t reverseBits(uint32_t n) {
        int i=0;
        uint32_t ret=0;
        for(;i<32;i++)
        {
            int x=n&0x1;
            ret=ret<<1;
            ret=ret|(n&0x1);
            n=n>>1;
        }
        
        return ret;
    }
};

本作品采用[知识共享署名-非商业性使用-相同方式共享 2.5]中国大陆许可协议进行许可，我的博客欢迎复制共享，但在同时，希望保留我的署名权kubiCode，并且，不得用于商业用途。如您有任何疑问或者授权方面的协商，请给我留言。

文章目录