LeetCode 算法刷题(7)

7. Reverse Integer

Reverse digits of an integer.

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

click to show spoilers.

Note:
The input is assumed to be a 32-bit signed integer. Your function should return 0 when the reversed integer overflows.

Subscribe to see which companies asked this question.

public class Test7 {
    public static void main(String[] args){
        Test7 test = new Test7();
        System.out.print(test.reverse(-10));
    }

    public int reverse(int x) {
        try{
            int index = 0;
            if(x<0){
                index = 1;
            }
            String s = String.valueOf(x);
            char[] c = s.toCharArray();
            int last = s.length()-1;
            for(int i=index,j=last;i<=j;i++,j--){
                char temp = c[i];
                c[i] = c[j];
                c[j] = temp;
            }
            return new Integer(Integer.parseInt(new String(c)));
        }catch(NumberFormatException e){
            return 0;
        }

    }
}


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值