LeetCode-Reverse Bits

最新推荐文章于 2019-05-17 18:36:31 发布

BeHelium

最新推荐文章于 2019-05-17 18:36:31 发布

阅读量133

点赞数

分类专栏： LeetCode 文章标签： LeetCode Bit Manipulation

本文链接：https://blog.csdn.net/qq_24133491/article/details/86629774

版权

LeetCode 专栏收录该内容

306 篇文章 0 订阅

订阅专栏

Description：
Reverse bits of a given 32 bits unsigned integer.

Example 1:

Input: 00000010100101000001111010011100
Output: 00111001011110000010100101000000
Explanation: The input binary string 00000010100101000001111010011100 represents the unsigned integer 43261596, so return 964176192 which its binary representation is 00111001011110000010100101000000.

Example 2:

Input: 11111111111111111111111111111101
Output: 10111111111111111111111111111111
Explanation: The input binary string 11111111111111111111111111111101 represents the unsigned integer 4294967293, so return 3221225471 which its binary representation is 10101111110010110010011101101001.

Note:

Note that in some languages such as Java, there is no unsigned integer type. In this case, both input and output will be given as signed integer type and should not affect your implementation, as the internal binary representation of the integer is the same whether it is signed or unsigned.
In Java, the compiler represents the signed integers using 2’s complement notation. Therefore, in Example 2 above the input represents the signed integer -3 and the output represents the signed integer -1073741825.

Follow up:

If this function is called many times, how would you optimize it?

题意：将一个无符号整数的二进制表示位颠倒，返回颠倒后得到的数；

解法：考虑一下，如果要求我们对一个一维数组同样进行颠倒的操作，很容易想到可以用首尾两个指示下标的变量遍历数组，交换首尾下标所在的元素，直到首尾两个指示变量相遇；同样的，要将一个二进制表示的所有位颠倒，定义两个首尾变量指示此时所在的位，每次我们获得所在位的值(0或1)后，利用移位操作赋给对应位置的位(首尾位置的交换)，直到首尾指示变量相遇；

Java

public class Solution {
    // you need treat n as an unsigned value
    public int reverseBits(int n) {
        int low = 0;
        int high = 31;
        int res = 0;
        while (low < high) {
            int low_bit = (n >> low) & 0x01; 
            int high_bit = (n >> high) & 0x01;
            res |= (high_bit << low);
            res |= (low_bit << high);
            low++;
            high--;
        }
        return res;
    }
}