算法: 翻转整数位190. Reverse Bits

Posted 架构师易筋

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了算法: 翻转整数位190. Reverse Bits相关的知识,希望对你有一定的参考价值。

190. Reverse Bits

Reverse bits of a given 32 bits unsigned integer.

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 a signed integer type. They should not affect your implementation, as the integer’s internal binary representation 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.

Example 1:

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

Example 2:

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

Constraints:

  • The input must be a binary string of length 32

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

1. 用&方法解决

public class Solution {
    // you need treat n as an unsigned value
    public int reverseBits(int n) {
        int result = 0;
        for (int i = 0; i < 32; i++) {
            result =  (result << 1) + ((n & 1) == 1 ? 1 : 0);
            n = (n >> 1);
        }
        
        return result;
    }
}

2. 用&更优雅的写法

public class Solution {
    // you need treat n as an unsigned value
    public int reverseBits(int n) {
        if (n == 0) return 0;
        int result = 0;
        for (int i = 0; i < 32; i++) {
            result <<= 1;
            if ((n & 1) == 1) result++;
            n >>= 1;
        }
        
        return result;
    }
}

参考

https://leetcode.com/problems/reverse-bits/discuss/54738/Sharing-my-2ms-Java-Solution-with-Explanation

以上是关于算法: 翻转整数位190. Reverse Bits的主要内容,如果未能解决你的问题,请参考以下文章

算法:190. Reverse Bits翻转比特或者整数

[LeetCode] 190. Reverse Bits 翻转二进制位

[LeetCode] 190. Reverse Bits_Easy tag: Bit Manipulation

7. Reverse Integer 翻转整型

190. Reverse Bits

C语言位运算的应用如何按bit位翻转一个无符号整型