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.
class Solution {
public:
int reverse(int x) {
int res = 0;
while(x != 0) {
int t = res * 10 + x % 10;
if (t / 10 != res) return 0;
res = t;
x /= 10;
}
return res;
}
};
需要注意的地方:
倒转数字主要需要考虑的问题就是溢出问题,int型的数值范围是 -2147483648~2147483647, 那么如果我们要翻转 1000000009 这个在范围内的数得到 9000000001,而翻转后的数就超过了范围;因此,本解法中,如果超出了范围,其除以10的结果就不会跟之前的结果一致
方法:
将数字中的每一位通过取模就可以得到数字的倒序排列,对得到的下一位数进行进位处理(乘以10)
如果担心溢出,还可以将int变成long long型变量来对res进行保存,最后返回的时候判断是否在Int的范围内
解法二:
class Solution {
public:
int reverse(int x) {
long long res = 0;
while (x != 0) {
res = 10 * res + x % 10;
x /= 10;
}
return (res > INT_MAX || res < INT_MIN) ? 0 : res;
}
};