leetcode

判断一个整数是否是回文数。回文数是指正序(从左向右)和倒序(从右向左)读都是一样的整数。

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
class  {
public boolean isPalindrome(int x) {
if(x<0){
return false;
}else {
String s = String.valueOf(x);
if (s.length()%2==0){
StringBuilder reverse = new StringBuilder(s.substring(s.length() / 2)).reverse();
return s.substring(0,s.length()/2).equals(reverse.toString());
}else {
return s.substring(0,s.length()/2+1).equals(new StringBuilder(s.substring(s.length()/2)).reverse().toString());
}
}
}
}

link https://leetcode-cn.com/problems/palindrome-number/