Leetcode judge whether palindrome number

/**
 *  Give you an integer  x , If  x  Is a palindrome integer , return  true ; otherwise , return  false .
 * <p>
 *  Palindrome number refers to positive order （ From left to right ） Reverse order （ From right to left ） Read all the same integers .
 * <p>
 *  for example ,121  It's palindrome. , and  123  No .
 * <p>
 *  source ： Power button （LeetCode）
 *  link ：https://leetcode.cn/problems/palindrome-number
 *
 * @param x
 * @return
 */

 public static boolean isPalindrome(int x) {
        String numStr = String.valueOf(x);
        StringBuilder stringBuilder = new StringBuilder(numStr);
        stringBuilder.reverse();
        return stringBuilder.toString().equals(numStr);
    }

Ideas ：

utilize java Of string function , Reverse string , Then compare the contents before and after inversion