-
[LeetCode] Reverse Bits알고리즘 2022. 5. 3. 02:10
class Solution: def reverseBits(self, n: int) -> int: r = 0 for _ in range(32): r = (r << 1) + (n & 1) n = (n >> 1) return r
'알고리즘' 카테고리의 다른 글
[LeetCode] Search in Rotated Sorted Array (0) 2022.05.04 [LeetCode] Single Number (0) 2022.05.03 [LeetCode] Number of 1 Bits (0) 2022.05.03 [LeetCode] Power of Two (0) 2022.05.03 70. Climbing Stairs (0) 2022.04.30