Determine whether an integer is a palindrome. An integer is a palindrome when it reads the same backward as forward.
Example 1:
1
2
|
Input: 121
Output: true
|
Example 2:
1
2
3
|
Input: -121
Output: false
Explanation: From left to right, it reads -121. From right to left, it becomes 121-. Therefore it is not a palindrome.
|
Example 3:
1
2
3
|
Input: 10
Output: false
Explanation: Reads 01 from right to left. Therefore it is not a palindrome.
|
判断数字是否是回文数问题。
分析：正负号都区分，可以直接转化为字符串处理了。详细代码如下：
1
2
3
4
5
6
7
8
9
10
11
12
13
14
|
class {
public boolean isPalindrome(int x) {
if (x < 0) {
return false;
}
String str = x + "";
for(int i = 0, j = str.length() - 1; i < j; i++, j--) {
if (str.charAt(i) != str.charAt(j)) {
return false;
}
}
return true;
}
}
|
近期评论