leetcode-9-java

Determine whether an integer is a palindrome. An integer is a palindrome when it reads the same backward as forward.

Example 1:

Input: 121
Output: true
Example 2:

Input: -121
Output: false
Explanation: From left to right, it reads -121. From right to left, it becomes 121-. Therefore it is not a palindrome.

public static boolean isPalindrome(int x) {
    if (x < 0) {
        return false;
    }

    char[] chars = ("" + x).toCharArray();
    for (int i = 0; i < chars.length / 2; i++) {
        if (chars[i] != chars[chars.length - 1 - i]) {
            return false;
        }
    }

    return true;
}