LeetCode_9---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.

Code:

/**
 * 
 */

/**
 * @author MohnSnow
 * @time 2015年6月2日 下午3:14:27
 * 
 */
public class LeetCode9 {
	public static boolean isPalindrome(int x) {
		if (x < 0) {
			return false;
		}
		String str = Integer.toString(x);
		int len = str.length() - 1;
		for (int i = 0; i < len - i; i++) {
			if (str.charAt(i) != str.charAt(len - i)) {
				return false;
			}
		}
		return true;
	}

	public static void main(String[] args) {
		int a = 132;
		System.out.println(isPalindrome(a));
	}
}

	//https://leetcode.com/discuss/33500/an-easy-lines-code-only-reversing-till-half-and-then-compare
	//java版本
	public static boolean isPalindrome1(int x) {
		if (x < 0 || (x != 0 && x % 10 == 0))//负数不是，个位数为0的也不是
			return false;
		int sum = 0;
		while (x > sum)
		{
			sum = sum * 10 + x % 10;
			x = x / 10;
		}
		return (x == sum) || (x == sum / 10);
	}