[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+"");
}

评论

发表回复

您的邮箱地址不会被公开。 必填项已用 * 标注

这个站点使用 Akismet 来减少垃圾评论。了解你的评论数据如何被处理