lintcode-413-反转整数

413-反转整数

思路

code

class Solution {
public:

/*
* @param n: the integer to be reversed
* @return: the reversed integer
*/
int reverseInteger(int n) {
// write your code here
bool isNeg = (n < 0);
n = abs(n);
long long res = 0;
do {
res *= 10;
res += n % 10;
n = n / 10;
}
while (n > 0);
if (res > INT_MAX) {
res = 0;
}
if (isNeg == true) {
return -1 * res;
}
return res;
}
};