05.07. Exchange
Description
Write a program to swap odd and even bits in an integer with as few instructions as possible (e.g., bit 0 and bit 1 are swapped, bit 2 and bit 3 are swapped, and so on).
Example1:
Input: num = 2οΌ0b10οΌ Output 1 (0b01)
Example2:
Input: num = 3 Output: 3
Note:
0 <= num <=
2^30 - 1- The result integer fits into 32-bit integer.
Solutions
Solution 1: Bit Manipulation
We can perform a bitwise AND operation between num
and 0x55555555
to get the even bits of num
, and then shift them one bit to the left. Then, we perform a bitwise AND operation between num
and 0xaaaaaaaa
to get the odd bits of num
, and then shift them one bit to the right. Finally, we perform a bitwise OR operation on the two results to get the answer.
The time complexity is $O(1)$, and the space complexity is $O(1)$.
1 2 3 |
|
1 2 3 4 5 |
|