leetcode:Bit Manipulation: Reverse Bits(190)

原创 2016年08月31日 15:26:57

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?


class Solution {
public:
    uint32_t reverseBits(uint32_t n) {
        uint32_t res = 0;
        for (int i = 0; i < 32; ++i) {
            res |= (((n >> i) & 1) << (31 - i));
        }
        return res;
   }
};
版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

LeetCode(190) Reverse Bits

题目如下: Reverse bits of a given 32 bits unsigned integer. For example, given input 43261596 (represe...

[LeetCode][190][Reverse Bits]

题目链接:

【LeetCode-190】 Reverse Bits(C++)

题目要求:要求将一个32位无符号整数所对应的二进制位反转得到的无符号整数。 解题思路:一般这种对应于二进制位的题目要考虑位运算!!而我可能对于位运算不太熟悉,每次都是用最愚蠢的办法做,虽然AC了,但是...

190. Reverse Bits\331. Verify Preorder Serialization of a Binary Tree

Reverse Bits description implementation Verify Preorder Serialization of a Binary Tree description i...

190. Reverse Bits [easy] (Python)

题目链接https://leetcode.com/problems/reverse-bits/题目原文 Reverse bits of a given 32 bits unsigned integ...

Bit Manipulation - Number of 1 Bits

计算无符号整型中二进制1的数目

leetcode第九周解题总结(Bit Manipulation位运算)

136. Single Number 137. Single Number II

LeetCode:Heap,Sort,Bit Manipulation,Backtracking

15.Heap先来复习一下stack,queue,heap的特点: 1.stack:FILO(先进后出) 2.queue:FIFO(先进先出) 3.heap:两个rules,1.the tree...

【LeetCode】Reverse Bits 翻转二进制

题目Reverse Bits Reverse bits of a given 32 bits unsigned integer. For example, given input ...

Leetcode - Reverse Bits

Reverse bits of a given 32 bits unsigned integer.For example, given input 43261596 (represented in b...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:leetcode:Bit Manipulation: Reverse Bits(190)
举报原因:
原因补充:

(最多只允许输入30个字)