[leetcode] Reverse Integer

Reverse Integer

  Total Accepted: 51832  Total Submissions: 168479 My Submissions

Reverse digits of an integer.

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

click to show spoilers.


package com.wyt.leetcodeOJ;

import java.math.BigInteger;

public class ReverseInteger {

	public static void main(String[] args) {
		int a = new BigInteger("9646324351").intValue();
		System.out.println(reverse(a));
	}

	public static int reverse(int x) {
		try {
			String s = String.valueOf(x);
			String result = "";
			if(x >= 0) {
				result = doReverse(s);
			} else {
				result = "-" + doReverse(s.substring(1));
			}
			return Integer.parseInt(result);
		} catch (Exception e) {
			return 0;
		}
    }

	private static String doReverse(String s) {
		char[] ss = s.toCharArray();
		int len = s.length();
		for (int i = 0; i < s.length()/2; i++) {
			char tp = ss[i];
			ss[i] = ss[len-1-i];
			ss[len-1-i] = tp;
		}
		return String.valueOf(ss);
	}
}


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值