[LeetCode]9. Palindrome Number
文章目录
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.
public boolean isPalindrome(int x) {
return new StringBuilder(x+"").reverse().toString().equals(x+"");
}
评论
登录后参与技术讨论,分享你的经验与见解。
登录 / 注册暂无评论