@@ -0,0 +1,567 @@
+/**%0A * Problem: https://leetcode.com/problems/reverse-bits/%0A * %0A */%0Apublic class Solution %7B%0A    // you need treat n as an unsigned value%0A    public int reverseBits(int n) %7B%0A        for(int i=0; i%3C32/2; i++) %7B%0A            n = swap(n, 32 - i - 1, i);%0A        %7D%0A        return n;%0A    %7D%0A    %0A    private int swap(int n, int i, int j) %7B%0A        int ai = (n %3E%3E i) & 1;%0A        int aj = (n %3E%3E j) & 1;%0A        return n + (aj - ai) * ((1%3C%3Ci) - (1%3C%3Cj));%0A        // if ((ai %5E aj) != 0) %7B%0A        //     return n %5E= (1 %3C%3C i) %7C (1 %3C%3C j);%0A        // %7D%0A        // return n;%0A    %7D%0A%7D%0A

Create Reverse_Bits.java