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

/**
 * 
 */
package com.cxm;

/**
 * @author admin
 *	【LeetCode】 Determine whether an integer is a palindrome. Do this without extra space
 */
public class PalindromeNumber
{
	//Determine whether an integer is a palindrome. Do this without extra space
	private static Integer i = 122;
	
	public static boolean solution(){
		String str = String.valueOf(i);
		char[] strChar = str.toCharArray();
		int intL = strChar.length;
		int length = strChar.length>>1;
		int i =0;
		while(i<length){
			if(strChar[i]!=strChar[intL-i-1]){
				return false;
			}
			i++;
		}
		return true;
	}
	
	public static void main(String[] args)
	{
		System.out.println(solution());
	}
	
	public static boolean solution1(){
		int rev = 0;
		int a = i ;
		while(i!=0){
			rev=rev*10+i%10;
			i/=10;
		}
		return rev==a;
	}	
}

【LeetCode】 Determine whether an integer is a palindrome. Do this without extra space,布布扣,bubuko.com

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

原文：http://blog.csdn.net/cxming007/article/details/24022361