LeetCode-in-Net/LeetCodeNet/G0101_0200/S0190_reverse_bits/Solution.cs at main · jscrdev/LeetCode-in-Net · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
namespace LeetCodeNet.G0101_0200.S0190_reverse_bits {

// #Easy #Top_Interview_Questions #Bit_Manipulation #Divide_and_Conquer
// #Algorithm_I_Day_14_Bit_Manipulation #Udemy_Bit_Manipulation #Top_Interview_150_Bit_Manipulation
// #2025_07_13_Time_18_ms_(93.43%)_Space_29.36_MB_(37.09%)

public class Solution {
    // you need treat n as an unsigned value
    public uint reverseBits(uint n) {
        uint ret = 0;
        // because there are 32 bits in total
        for (int i = 0; i < 32; i++) {
            ret = ret << 1;
            // If the bit is 1 we OR it with 1, ie add 1
            if ((n & 1) > 0) {
                ret = ret | 1;
            }
            n = n >> 1;
        }
        return ret;
    }
}
}