Leetcode 7. Reverse Integer(java版)

题目 and example：

Reverse digits of an integer.

Example1: x = 123, return 321
Example2: x = -123, return -321
Note:
The input is assumed to be a 32-bit signed integer. Your function should return 0 when the reversed integer overflows.

题目大意：

将一个整数翻转后返回。

思路：

要注意溢出

代码：

class Solution {
    public static int reverse(int x) {
         int rev = 0;
         while(x!=0)
         {
             if (rev != 0 && Integer.MAX_VALUE / rev < 10
                       && Integer.MAX_VALUE / rev > -10)
                   return 0;
             rev = rev * 10 + x % 10;
             x = x / 10;
         }
         return rev;                    
    }
}