判断回文数,之前写过的方法太啰嗦了,这里找到一个别人优化过的,忘记留从哪找的了,所以记录下来:
package pratice.leetcode; public class problem9 { public static boolean isPalindrome(int x){ if(x<0||(x%10==0&&x!=0)){ return false; } int reserverNumber=0; while(x>reserverNumber){ //最关键的判断条件 reserverNumber=reserverNumber*10+x%10; x=x/10; } System.out.println("reserverNumber:"+reserverNumber+",x:"+x); return x==reserverNumber||x==reserverNumber/10; } public static void main(String[] args){ System.out.print(isPalindrome(12456)); } }