【LeetCode】9. Palindrome Number

### 1.题目

Determine whether an integer is a palindrome. An integer is a palindrome when it reads the same backward as forward.

Example 1:

Input: 121
Output: true


Example 2:

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:

Input: 10
Output: false
Explanation: Reads 01 from right to left. Therefore it is not a palindrome.


### 3.编程实现

public class PalindromeNumber {
public boolean isPalindrome(int x) {
if (x < 0) return false;
int palind = x;    // 留出到最后进行比较
int rev = 0;
while (x > 0){
rev = rev*10 + x % 10;
x /= 10;
}
return palind == rev; // 返回比较结果
}
}


### 5.个人订阅号

上一篇

2019-02-08

【LeetCode】8. String to Integer (atoi)
1.题目Implement atoi which converts a string to an integer. The function first discards as many whitespace characters as n
2019-01-30
目录