LeetCode OJ - Reverse Integer

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.

my answer:

public class Solution {

	public static int getReverse(ing x){
        String temp = x+ "";
        StringBuilder sb = new StringBuilder();

        for(int i=temp.length()-1;i>=0;i--){
        	sb.append(temp.charAt(i) + "");
        }

        int y = Integer.parseInt(sb.toString());
        return y;
    }

    public static int reverse(int x) {
    	long num;
        if(x>0 & x<Integer.MAX_VAVLUE){
        	num = getReverse(x);
        }else if(x<0 & x>Integer.MIN_VAVLUE){
        	num = -getReverse(-x);
        }else
        	num = 0;
    return num;        
    }

    public static void main(String[] args){

    	try{
    		int num = reverse(9646324351);
    	}catch (Exception e){
    		num = 0;
    	}
    	System.out.println(num);
    }
}
呃呃呃,首先不仅是编译没通过(说 过大的整数: 9646324351)(觉得我有判断int的范围呀 为啥木有筛出去=.=)。其次,算法太复杂了吧...我都给自己跪了...最重要的是,没有想到,如果int x 在范围内,revers x 还是否在范围内呢? 总之漏洞百出,有待改善...

参考:http://blog.csdn.net/zhouworld16/article/details/16067825

改进:

public class Solution {

    public static int reverse(long x) {

    	if(x> Integer.MAX_VALUE || x<Integer.MIN_VALUE)
    		return 0;

    	long y = x;
    	long num = 0;
    	while(y!=0){
    		long temp = y%10;
    		num = num*10 + temp;		
    		if(num > Integer.MAX_VALUE/10 || num<Integer.MIN_VALUE/10){   			
    			if(num > Integer.MAX_VALUE || num<Integer.MIN_VALUE  ){
    				return 0;
    			}
    				
    		}
    		y/=10;
    		
    	}
    	return (int)num;        
    }

    public static void main(String[] args){

    	//int num = reverse(9646324351);
    	//int num = reverse(1534236469);
    	int num = reverse(-2147483648);
    	System.out.println(num);
    }
}

Runtime:3ms



评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值