Palindrome Number

Determine whether an integer is a palindrome. Do this without extra space.

click to show spoilers.

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.

判断一个数是否为会文数：

转换为字符串n1，倒序转换问字符串n2，两者比较。

package leetcode;

public class PalindromeNumber {

public static boolean isPalindrome(int x) {

        String n1 = x+"";

        char[] chars = n1.toCharArray();

        String n2 = "";

        for (int i = chars.length-1; i>=0; i--){

        n2 = n2 + chars[i];

        }

        if (n1.equals(n2)){

        return true;

        }else {

        return false;

        }

    }

public static void main(String[] args) {

// TODO Auto-generated method stub

if (isPalindrome(10)){

System.out.println("true");

}else {

System.out.println("false");

}

}

}