Reverse Integer leetcode 刷题之旅

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.

这道题难点在于翻转后你不确定是否数据溢出，因此你需要判断，这一步解决了，程序也就解决了。

int reverse(int x) {
        int result = 0;
        while (x != 0) {
            if (abs(result) > INT_MAX / 10) return 0;
            result = result * 10 + x % 10;
            x /= 10;
        }
        return result;
    }