LeetCode 7. Reverse Integer

Reverse digits of an integer.

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

把数据从低位到高位依次反转即可，注意有可能溢出，所以用long类型保存结果，然后判断是否溢出，溢出则返回0.

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