回文数:正反两个方向读起来的数字相等 public class Palindrome { public boolean isPalindrome(int x) { int revertednumber = 0; if(x<0 || x%10 == 0 && x != 0){ return false; } while(revertednumber < x){ revertednumber = revertednumber * 10 + x % 10; x = x/10; } return revertednumber == x || x == revertednumber/10; } public static void main(String[] args) { int x = 1221; Palindrome p = new Palindrome(); System.out.println(p.isPalindrome(x)); } }
leetcode---回文数
最新推荐文章于 2021-10-15 15:40:03 发布