整数反转

给出一个 32 位的有符号整数，你需要将这个整数中每位上的数字进行反转。

示例 1:

输入: 123
输出: 321
 示例 2:

输入: -123
输出: -321
示例 3:

输入: 120
输出: 21
注意:

假设我们的环境只能存储得下 32 位的有符号整数，则其数值范围为 [−231,  231 − 1]。请根据这个假设，如果反转后整数溢出那么就返回 0。

package com.ljm.easy.onetofifty;

/**
 * Created by linjiaming
 *
 * Given a 32-bit signed integer, reverse digits of an integer.
 *
 * Example 1:
 *
 * Input: 123
 * Output: 321
 * Example 2:
 *
 * Input: -123
 * Output: -321
 * Example 3:
 *
 * Input: 120
 * Output: 21
 * Note:
 * Assume we are dealing with an environment which could only store integers within the 32-bit signed integer range: [−231,  231 − 1].
 * For the purpose of this problem, assume that your function returns 0 when the reversed integer overflows.
 *
 * 来源：力扣（LeetCode）
 * 链接：https://leetcode-cn.com/problems/reverse-integer
 * 著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。
 */
public class ReverseInteger {

    public static void main(String[] args) {
        int reverse = reverse2(12350);
        System.out.println(reverse);
    }

    /**
     * 方法一
     * @param x
     * @return
     */
    public static int reverse1(int x) {
        int flag = x < 0? -1 : 1;
        //取绝对值
        String xx = String.valueOf(Math.abs(x));
        String r = new StringBuilder(xx).reverse().toString();
        try{
            int result = flag * Integer.parseInt(r);
            return result;
        }catch(Exception e){
            return 0;
        }
    }

    /**
     * 方法2
     * @param x
     * @return
     */
    public static int reverse2(int x) {
        long result = 0;
        int temp = x;
        while (temp != 0) {
            int mod = temp % 10;
            result = result * 10 + mod;
            if (result > Integer.MAX_VALUE || result < Integer.MIN_VALUE) {
                return 0;
            }
            temp = temp / 10;
        }
        return (int) result;
    }
}