Today, I solved "Reverse Bits."
Description:

In this problem, we are gonna do reverse order of 32-bits number.
Solution:

"output" will store "0" or "1." If the bit number is 1, then the output store 1 in it.
Otherwise, it stores 0.
In output, we shift the bit left, and also we shift the bit right in n.
'LeetCode ๐๏ธ > Binary' ์นดํ ๊ณ ๋ฆฌ์ ๋ค๋ฅธ ๊ธ
| 268. Missing Number (0) | 2023.05.23 |
|---|---|
| 338. Counting Bits (0) | 2023.05.22 |
| 191. Number of 1 Bits (0) | 2023.05.08 |
| 371. Sum of Two Integers (0) | 2023.05.07 |