Leetcode-reverse Bits

Binary conversions and string reversal. To consider the range of int, the test data is overflow. Math.pow is a loss of precision, preferably written in integers.

 Public classReversebits { Public Static intReversebits (intN) {StringBuilder sb=NewStringBuilder (integer.tobinarystring (n)); StringBuilder s=NewStringBuilder (Sb.reverse ()); if(S.length ()!=32) {             while(S.length ()! = 32) {s.append ("0"); }        }        //System.out.println (s);        intAns = 0;  for(intI=s.length ()-1; i>=0; i--) {            if(S.charat (i) = = ' 1 ') {                //System.out.println (s.length () -1-i);Ans + = POW (2, S.length ()-1-i); }        }        returnans; }     Public Static intPowintNintm) {intAns = 1;  for(inti=0; i<m; i++) {ans*=N; } ans=math.abs (ans); returnans; }

Leetcode-reverse Bits