[Leetcode]Reverse Integer

Reverse digits of an integer.

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

class Solution {
public:
/*algorithm
if x is neg numer, and -x overlfows, return 0
otherwise, x = -x
for x, when reverse x ,it can overflow, at that time, return 0
*/
int reverse(int x) {
int sum = 0;
while(x != 0){
if(abs(sum) > INT_MAX/10)return 0;
sum = sum*10 + x%10;
x /= 10;
}
return sum;
}
};