LeetCode:Reverse Bits

Reverse Bits

Total Accepted: 43722 Total Submissions: 150010 Difficulty: Easy

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.

Subscribe to see which companies asked this question























思路:

1.假设只有8位,n=0000 1101,要转化成ret=10110000

2.首先ret=00000000

3.判断n的最后一位是0还是1,int b=n&1,n>>=1;

4.ret = ret | b,最后一位放到ret的最后一位,ret<<=1;

5.if(i--<8)转3;(这里i初值为8);



code:

class Solution {
public:
    uint32_t reverseBits(uint32_t n) {
        int ret=0;
        int i=32;
        while(i--)
        {
            ret<<=1;// 这里ret先移位,再赋值,因为当n取得最高位的时候,ret不需要再移位
            ret |= n&1;
            n>>=1;
        }
        return ret;
    }
};


阅读更多
版权声明:本文为博主原创文章,转载请注明出处。 https://blog.csdn.net/itismelzp/article/details/49947529
文章标签: LeetCode Reverse Bits
个人分类: LeetCode OJ
所属专栏: LeetCode解题记录
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

不良信息举报

LeetCode:Reverse Bits

最多只允许输入30个字

加入CSDN,享受更精准的内容推荐,与500万程序员共同成长!
关闭
关闭