题目描述
Reverse digits of an integer.
Example1: x = 123, return 321
Example2: x = -123, return -321
Notice
Have you thought about this?
Here are some good questions to ask before coding. Bonus points for you if you have already thought through this!
If the integer’s last digit is 0, what should the output be? ie, cases such as 10, 100.
Did you notice that the reversed integer might overflow? Assume the input is a 32-bit integer, then the reverse of 1000000003 overflows. How should you handle such cases?
For the purpose of this problem, assume that your function returns 0 when the reversed integer overflows.
Note:
The input is assumed to be a 32-bit signed integer. Your function should return 0 when the reversed integer overflows.
class Solution {
public:
int reverse(int x) {
long long res = 0;
if (x>INT_MAX||x<INT_MIN)
return 0;
while(x!=0)
{
res = res*10 + x%10;
x = x/10;
}
return (res>INT_MAX||res<INT_MIN)? 0:res;
}
};
由于反转后数值可能非常大,因此需要long long 类型的来存储结果。但是,函数返回的又是一个int类型的值,因此,当结果超过INT类型的边界时,需要返回0