[LeetCode]7. Reverse Integer&190. Reverse Bits

7 . Reverse Integer
Easy

Reverse digits of an integer.

Example1: x = 123, return 321
Example2: x = -123, return -321

click to show spoilers.

Have you thought about this?
Here are some good questions to ask before coding. Bonus points for you if you have already thought through this!

If the integer’s last digit is 0, what should the output be? ie, cases such as 10, 100.

Did you notice that the reversed integer might overflow? Assume the input is a 32-bit integer, then the reverse of 1000000003 overflows. How should you handle such cases?

For the purpose of this problem, assume that your function returns 0 when the reversed integer overflows.

40ms:

public int reverse(int x) {
        String num = x+"";
        int start = 0,end = num.length()-1;
        int t = 1;
        if(num.charAt(0)=='+'||num.charAt(0)=='-'){
            start++;
            if(num.charAt(0)=='-') t = -1;
        }
        Long res =(long) 0;
        while(end>=start){
            res = res*10 + (num.charAt(end)-'0');
            end--;
        }
        if(res>Integer.MAX_VALUE) return 0;
        else return (int) ((int) t*res);
}

40ms:

 public int reverse(int x) {
        long r = 0;
        while(x != 0){
            r = r*10 + x%10;
            x /= 10;
        }
        if(r >= Integer.MIN_VALUE && r <= Integer.MAX_VALUE)
            return (int)r;
        else
            return 0;
}

190 . Reverse Bits
Easy

Easy

Reverse bits of a given 32 bits unsigned integer.

For example, given input 43261596 (represented in binary as 00000010100101000001111010011100), return 964176192 (represented in binary as 00111001011110000010100101000000).

Follow up:
If this function is called many times, how would you optimize it?

Related problem: Reverse Integer

public int reverseBits(int n) {
         int res = 0;
         for(int i=0;i<31;i++){
            res |= (n&1);
            n = n >>> 1;
            res = res <<1;
         }
         res |= (n&1);
         return res;
}