LeetCode 算法学习(4)

題目描述

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

Example 1:
Input: 123
Output: 321

Note:
Assume we are dealing with an environment which could only store integers within the 32-bit signed integer range: [−2³¹, 2³¹ − 1]. For the purpose of this problem, assume that your function returns 0 when the reversed integer overflows.

題目大意

给出一个32位带符号的整数，将其数字反转；当出现溢出时返回0。

思路分析

这是一道比较简单的题目，关键在于对溢出的判断；32位带符号整数的取值范围是：[-2³¹,2³¹-1]，即：[-2147483648,2147483647]，这样就可以根据最后一位来判断是否溢出了。

关键代码

    int reverse(int x) {
        int rev = 0;
        while (x != 0) {
            int pop = x%10;
            if (rev > INT_MAX/10 || (rev == INT_MAX/10 && pop > 7)) return 0;
            if (rev < INT_MIN/10 || (rev == INT_MIN/10 && pop < -8)) return 0;
            rev = 10*rev + pop;
            x /= 10;
        }
        return rev;
    }

总结

主要是要考虑溢出的判断和取值范围，实现起来并不难。