LeetCode | Reverse Integer

7.Reverse Integer

Description

Given a 32-bit signed integer, reverse digits of an integer.

Example

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: [−2^31,  2^31 − 1]. 
For the purpose of this problem, assume that your function returns 0 when the reversed integer overflows.

Solution: (Java)

class Solution {
    public int reverse(int x) {
        int rev = 0;
        while (x != 0) {
            int pop = x % 10;
            x /= 10;
            if (rev > Integer.MAX_VALUE/10 || (rev == Integer.MAX_VALUE / 10 && pop > 7))
                return 0;
            if (rev < Integer.MIN_VALUE/10 || (rev == Integer.MIN_VALUE / 10 && pop < -8))
                return 0;
            rev = rev * 10 + pop;   // rev may be overflow, so put it to last
        }
        return rev;
    }
}

思路：本题不能通过简单的字符串 reverse 的技巧来解决，考的就是溢出的检测。思路是不断取出（pop）最后一位，相应的翻转的整数就是不断进（push）一位，即 乘于 10 再加上 pop 出来的数，由于rev = rev * 10 + pop可能导致溢出，所以将其放在最后面，为了提前判断是否溢出。