[算法相关] 9. Palindrome Number-数字的回文

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.

判断一个数字是否是回文数字：

 

public class Solution {
    public boolean isPalindrome(int m) {
    int low,top;
		int count =1;
		if(m<0) return false;
		int temp=m;
		while(temp>=10){
			temp=temp/10;
			count++;
		}//求数字的位数
		for(int pow=0;pow<count/2;pow++){
			if(m/Pow(10,pow)%10!=m/Pow(10,count-1-pow)%10){
				return false;
			}
		}
		
		return true;
	}
	private static int Pow(int num,int pow){
		if(pow==0) return 1;
		if(pow==1) return num;
		return num*Pow(num,pow-1);
    }//两个数的幂
}