[Leetcode]7. Reverse Integer

题目大意：

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.

注意overflow的问题：
1.long result;

2.if (result>Integer.MAX_VALUE || result<Integer.MIN_VALUE) { return 0;} 这种对overflow的处理

public int reverse(int x) {
        long result=0;
        if(x==0) return 0;
        while(x!=0){
            result=result*10+x%10;
            x=x/10;
            if(result>Integer.MAX_VALUE ||result<Integer.MIN_VALUE){
                return 0;
            }
        }
        return (int)result;
}