Leetcode-Reverse Integer

*做的时候没有掌握好count的最大值与最小值问题,
最后count输出时没有强制转换成int，导致出错！*

/*
Reverse digits of an integer.
Example1: x = 123, return 321
Example2: x = -123, return -321 
*/
public class Solution {
    public int reverse(int x) {
        long count = 0;
        while(x != 0) {

            count = count*10 + x%10;
            x = x/10;
        }
        if((count>Integer.MAX_VALUE||count<Integer.MIN_VALUE))
            return 0;
        return (int)count;
    }
}