9 Palindrome Number

class Solution {
    public boolean isPalindrome(int x) {
        if (x < 0) {
        	return false;
        }
        int[] a = new int[10];
        int len = 0;
        while (x != 0) {
        	a[len] = x % 10;
        	x /= 10;
        	len++;
        }
        for (int i = 0; i < len / 2; i++) {
        	if (a[i] != a[len - i - 1])
        		return false;
        }
        return true;
    }
}