leetcode刷题(2)

Reverse digits of an integer.

Example1: x = 123, return 321
Example2: x = -123, return -321

Note:
The input is assumed to be a 32-bit signed integer. Your function should return 0 when the reversed integer overflows.

简单的说就是翻转数字，注意几个坑就很简单，x=100，return 1什么的，还有要注意数字越界，比如1000000003反转就会越界，所以把判断越界的条件放在后面比较简单。

代码：
class Solution {
public:
int reverse(int x) {
long long j = 0;
while(x)
{
j = j * 10 + x % 10;
x = x / 10;
}
if(j > INT_MAX || j < INT_MIN)
{
return 0;
}
return j;
}

};