题目
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.
解法:
正常反转,主要考虑边界问题。因为乘10可能会越界,所以提前做一步判定
代码如下:
int reverse(int x) {
int reNum = 0;
int max = INT_MAX/10;
int min = INT_MIN/10;
while (x != 0) {
if (reNum > max || reNum < min)
return 0;
reNum = reNum * 10 + x % 10;
x /= 10;
}
return reNum;
}