leetcode-patterns-java/LeetCode_Problems/Java/easy/0190. Reverse Bits.java at main · elchibek5/leetcode-patterns-java · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
class Solution {
    public int reverseBits(int n) {
        int result = 0;

        for (int i = 0; i <= 32; i++) {
            int bit = (n >> i) & 1;

            if (bit == 1) {
                result |= 1 << (31 - i);
            }
        }
        return result;
    }
}