LeetCode 190 - Reverse Bits - 题解/Solution

https://leetcode.com/problems/reverse-bits/

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
/**
<!-- more -->

<pre><code>/**
* 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?
*
* @author dongyuxi
*
*/
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 |= (((n >> i) & 1) << (31 - i));
}
return result;
}
}


支付宝 微信
文章目录