关闭

LeetCodeOJ_190_Reverse Bits

标签: OJ算法c++
174人阅读 评论(0) 收藏 举报
分类:

答题链接

题目:

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
Tags Bit Manipulation
Similar Problems (E) Number of 1 Bits

分析:

代码:

class Solution {
public:
    uint32_t reverseBits(uint32_t n) {
        uint32_t m=0;
        for(int i=0;i<32;i++)
        {
            m=m*2+n%2;
            n=n/2;
        }
        return m;
    }
};

结果:

这里写图片描述

总结:

0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:6959次
    • 积分:360
    • 等级:
    • 排名:千里之外
    • 原创:32篇
    • 转载:3篇
    • 译文:0篇
    • 评论:0条