Palindrome Number (1221)

class Solution {
    public boolean isPalindrome(int x) {
        // any negative input is not a palindrome
        if (x < 0) {
            return false;
        }

        var number = x;
        var reversedNumber = 0;
        var lastDigit = 0;
        while (number > 0) {
            lastDigit = number % 10;

            // check for overflow below updating reversedNumber
            // In Java, int is a 32 bit signed integer 
            //  from -2,147,483,648 to 2,147,483,647.
            if (reversedNumber > Integer.MAX_VALUE - lastDigit){
                return false;
            }

            reversedNumber = (reversedNumber * 10) + lastDigit;
            number = number / 10;
        }

        if (reversedNumber == x){
            return true;
        }
        return false;
    }
}