Leetcode: 190. Reverse Bits(JAVA)

最新推荐文章于 2022-03-15 00:15:37 发布

那莫名

最新推荐文章于 2022-03-15 00:15:37 发布

阅读量1k

点赞数

分类专栏： Leetcode 文章标签： leetcode java

本文链接：https://blog.csdn.net/u010183658/article/details/50876492

版权

Leetcode 专栏收录该内容

68 篇文章 1 订阅

订阅专栏

【问题描述】

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

【思路】

类似于整数反转，首先按位与取最后一位后，依次右移1位。同时将结果左移1位，按位或。

【代码】

public class Solution {
    // you need treat n as an unsigned value
    public int reverseBits(int n) {
        int result = 0;
		int i = 0;
		while (i < 32) {
			int temp = n & 0x01;
			n = n >> 1;

			result = (result << 1) | temp;
			i++;
		}
		return result;
    }
}