问我试图解决一个Leetcode问题，关于识别输入的数字是否为回文。

EN

class Solution {
public boolean isPalindrome(int x) {
    // 2 cases  x < 0 = false case 
    //  x > 0 = test case
    
    if (x < 0 || x % 10 == 0 && x != 0){
        return false;
    }
    else {
        int newNum = 0;
        while (x > newNum){
        int r = (x % 10);
        newNum = newNum * 10 + r;
        x /= 10;
        }
    //the part I am confused about - below     
    return x == newNum || x == newNum / 10;
    }
   
    }  
}