Reverse Integer -- LeetCode

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.

Update (2014-11-10):
Test cases had been added to test the overflow behavior.

[解题思路]

一般来说整数的处理问题要注意的有两点，一点是符号，另一点是整数越界问题

Init Code : RunTime 308ms

public int reverse(int x) {
        boolean negative = false;
        String str = String.valueOf(x);
         if(x<0){
            negative = true;
            str = str.substring(1);
        }
        char[] strArray = str.toCharArray();
        int length = strArray.length;
        
        for(int i=0;i<length/2;i++){
        	char temp = strArray[i];
        	strArray[i] = strArray[length-1-i];
        	strArray[length-1-i] = temp;
        }
        str = String.valueOf(strArray);
        int reverseX = 0;
        try{
             reverseX = Integer.parseInt(str);
        }catch(Exception e){
            return reverseX;
        }
        if(negative){
            return -reverseX;
        }
        return reverseX;
    }

Improved Code : RunTime :296ms

时间上虽然提升不明显，但是处理上并无需借助String，直接做数字操作即可

public int reverse(int x) {
	   if(x==Integer.MIN_VALUE)
	       return 0;
	   int num = Math.abs(x);
	   int res = 0;
	   while(num!=0){
	       if(res > (Integer.MAX_VALUE-num%10)/10){
	           return 0;
	       }
	       res = res*10+num%10;
	       num /= 10;
	   }
	   return x>0?res:-res;
    }

转载于:https://my.oschina.net/sunnycx/blog/484557