leetcode--07 --Reverse Integer(逆转整数)

* 原题 * Reverse digits of an integer. * Example1: x = 123, return 321 * Example2: x = -123, return -321 * * 题目大意 * 输入一个整数对其进行翻转 * *

　　

package com.hust0407;

import java.util.Scanner;

/**
 * Created by huststl on 2018/4/7 10:34
 * 输入一个整数对其进行翻转
 */
public class Main04 {
    //通过求余数求商法进行操作
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        while (scan.hasNext()){
            int num = scan.nextInt();
            System.out.println(reverse(num));
        }
    }

    private static int reverse(int num) {
        long tmp = num;
        //防止结果溢出
        long result = 0;
        //余数求商法
        while (tmp!=0){
            result = result * 10 + tmp %10;
            tmp = tmp/10;
        }
        //溢出判断
        if(result<Integer.MIN_VALUE || result >Integer.MAX_VALUE){
            result = 0;
        }

        return (int)result;
    }
}