https://leetcode-cn.com/problems/palindrome-number/
class Solution {
public boolean isPalindrome(int x) {
if (x < 0) {
return false;
}
if (x == 0) {
return true;
}
int n = (int) Math.log10(x) + 1;
int[] cArray = new int[n];
for (int i = 0; i < n; i++) {
cArray[i] = x%10;
x/=10;
}
int i=0,j=n-1;
while (i<j){
if(cArray[i]!=cArray[j]){
return false;
}
i++;j--;
}
return true;
}
}