[LeetCode] 190 Reverse Bits

1 2 3 4 5 6 7 8 9 10 11 12

class Solution { public: int reverseBits(int n) { int ans = 0; for (int i = 0; i < 32; i++) { ans <<= 1; ans |= (n & 1) ; n >>= 1; } return ans; } };