[LeetCode-Java]7. Reverse Integer

Reverse digits of an integer.

Example1: x = 123, return 321

Example2: x = -123, return -321

解：需要考虑int边界，做溢出处理。

public class Solution {
public int reverse(int x) {
int max = 0x7fffffff;  //int最大值
int min = 0x80000000;  //int最小值
long sum = 0;

while(x != 0)
{
int temp = x % 10;
sum = sum * 10 + temp;
if (sum > max || sum < min)   //溢出处理
{
sum = 0;
break;
}
x = x / 10;
}
return (int)sum;
}
}