整型的边界奥义——Reverse Integer（整数反转）_C++

链接：https://leetcode-cn.com/problems/reverse-integer/

题目

Given a signed 32-bit integer x, return x with its digits reversed. If reversing x causes the value to go outside the signed 32-bit integer range [-231, 231 - 1], then return 0.

Assume the environment does not allow you to store 64-bit integers (signed or unsigned).

Example 1:

Input: x = 123
Output: 321

Example 2:

Input: x = -123
Output: -321

Example 3:

Input: x = 120
Output: 21

Example 4:

Input: x = 0
Output: 0

Constraints:

• -pow(2,31) <= x <= pow(2,31)-1

思路

反转整数的思路在于使用求余和除法相结合，此处不许多介绍。

关键点是对于反转数的边界判断，且保存这个反转数至少是long，因为int已经无法装下。

 

代码

    int reverse(int x) {
        long tmp = 0;
        while(x!= 0){
            tmp = tmp*10 + x%10;
            x = x/10;
        }
        if(tmp > pow(2,31)-1 || tmp < -pow(2,31)){
            return 0;
        }
        return tmp;
    }