package leetcode; //121 class Solution1 { public boolean isPalindrome(int x) { if(x<0) return false; else { int m = x % 10; int k=x/10; while (k > 0) { int n = k % 10; k = k / 10; m = m * 10 + n; } System.out.println(m); return x == m; } } } public class level { public static void main(String[] args) { Solution1 solution = new Solution1(); System.out.println(solution.isPalindrome(-121)); } }
力扣回文数java
最新推荐文章于 2024-07-20 23:55:03 发布