算法-leetcode007-整数反转

public static int reverse(int x) {
    int pop;
    int res = 0;
    while (x != 0) {
        pop = x % 10;
        System.out.println("pop: " + pop);
        x = x / 10;
        System.out.println("x: " + x);
        if (res > Integer.MAX_VALUE / 10 || (res == Integer.MAX_VALUE / 10 && pop > 7)) {
            return 0;
        }
        if (res < Integer.MIN_VALUE / 10 || (res == Integer.MIN_VALUE / 10 && pop < -8)) {
            return 0;
        }
        System.out.println("res before: " + res);
        res = res * 10 + pop;
        System.out.println("res after: " + res);
    }
    return res;
}