leetcode 9 java

public class Solution{
	public boolean intPalindrome(int num){
		if(num<0) return false;
		int base = 1;
		while(num/base>=10) base* =10;
		while(num>0){
			int first = num / base;
			int lase = num % 10;
			if(first != lase) return false;
			num = (num%base) /10;
			base = base /100;
}
return true;
}
}

你可能感兴趣的:(leetcode)