LeetCode 7. Reverse Integer

题目来源：https://leetcode.com/problems/reverse-integer/

问题描述

7. Reverse Integer

Easy

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.

------------------------------------------------------------

题意

给定一个整数，求其按十进制位的逆写。（如果逆写超限，则输出0）

------------------------------------------------------------

思路

注意32位int的逆写可能超过32位，故用long存储。

------------------------------------------------------------

代码

class Solution {
    public static long pos_inf = 2147483647, neg_inf = -2147483648;
    public int reverse(int x) {
        boolean sign;
        int i = 0;
        long ans = 0, dig = 0;
        if (x < 0)
        {
            sign = false;
            x = -x;
        }
        else
        {
            sign = true;
        }
        for (i=0; i<12; i++)
        {
            if (x == 0)
            {
                break;
            }
            dig = x % 10;
            x /= 10;
            ans = ans * 10 + dig;
        }
        if (!sign)
        {
            ans = -ans;
        }
        if (ans > pos_inf || ans < neg_inf)
        {
            return 0;
        }
        else
        {
            return (int)ans;
        }
    }
}