数字翻转,正负一起考虑
用long long 来处理int的溢出问题
/*
Reverse digits of an integer.
Example1: x = 123, return 321
Example2: x = -123, return -321
*/
class Solution {
public:
int reverse(int x) {
long long int ret=0;
while(x){
ret = 10*ret + x%10;
if(ret>INT_MAX||ret<INT_MIN) //用longlong来判断溢出
return 0;
x = x/10;
}
return ret;
}
};