LeetCode 9. 回文数

class Solution {
    public boolean isPalindrome(int x) {
        String s = Integer.toString(x);
        char[] c = s.toCharArray();
        for(int i = 0;i < c.length / 2;i++){
            if(c[i] != c[c.length - i - 1]){
                return false;
            }
        }
        return true;
    }
}