Is there a LeetCode algorithm to determine if a number is a palindrome?

本文共计119个文字，预计阅读时间需要1分钟。

java/** * 9. Palindrome Number * Determine whether an integer is a palindrome. Do this without extra space. * * @param x * @return */public static boolean isPalindrome(int x) { if (x reversed) { reversed=reversed * 10 + x % 10; x /=10; } return x==reversed || x==reversed / 10;}

PalindromeNumber.java

/** * 9. Palindrome Number * Determine whether an integer is a palindrome. Do this without extra space. * @param x * @return */ public static boolean isPalindrome(int x) { if(x<0){ return false; } if(x<10){ return true; } int devF = 1; while(x / devF >= 10){ devF *= 10; } while(x>0){ int first = x/devF; int last = x%10; if(first!=last){ return false; } x = (x % devF) / 10; devF = devF/100; } return true; }