class Solution {
    public boolean isPalindrome(int x) {
        if(x < 0 || (x % 10 == 0 && x != 0)) {
            return false;
        }
        String s = Integer.toString(x);

        if(s.length() == 1) {
            return true;
        }

        int i = 0;
        int j = s.length() - 1;

        int[] digits = getDigits(x);
        while (i < j) {
            if(digits[i] != digits[j]) {
                return false;
            }
            i++;
            j--;
        }

        return true;
    }

    private int[] getDigits(int x) {
        int tmp = x;
        int count = 0;
        while (tmp != 0) {
            tmp /= 10;
            count++;
        }

        int[] num = new int[count];
        int i = count - 1;
        while (x != 0) {
            int k = x % 10;
            num[i--] = k;
            x /= 10;
        }

        return num;
    }
}