9. Palindrome Number（21.01%）

题目：Determine whether an integer is a palindrome. Do this without extra space.
Some hints:
Could negative integers be palindromes? (ie, -1)

If you are thinking of converting the integer to string, note the restriction of using extra space.

You could also try reversing an integer. However, if you have solved the problem “Reverse Integer”, you know that the reversed integer might overflow. How would you handle such case?

There is a more generic way of solving this problem.
个人理解：判断输入的整数是否是回文。

public class Solution {
    public boolean isPalindrome(int x) {
        boolean isPalindrome = true;

        if (x < 0) {
            return false;
        }

        char[] xArray = String.valueOf(x).toCharArray();
        int len = xArray.length;
        if (len % 2 == 0) {
            // 偶数位
            int pivotRight = len / 2;
            int pivotLeft = pivotRight - 1;
            for (int i = 0; i < pivotRight; i++) {
                if (xArray[pivotLeft - i] != xArray[pivotRight + i]) {
                    return false;
                }
            }
        } else {
            // 奇数位
            int pivot = len / 2;
            for (int i = 0; i <= pivot; i++) {
                if (xArray[pivot - i] != xArray[pivot + i]) {
                    return false;
                }
            }
        }

        return isPalindrome;
    }
}