LeetCode - 009

最新推荐文章于 2022-11-02 14:00:00 发布

咸鱼学 Python

最新推荐文章于 2022-11-02 14:00:00 发布

阅读量138

点赞数

本文链接：https://blog.csdn.net/weixin_43189702/article/details/103513179

版权

原题

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

题干

Given an array of integers, return indices of the two numbers such that they add up to a specific target.
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.
Follow up:

Coud you solve it without converting the integer to a string?

这是凑字数的这是凑字数的这是凑字数的这是凑字数的这是凑字数的这是凑字数的这是凑字数的这是凑字数的这是凑字数的这是凑字数的这是凑字数的这是凑字数的这是凑字数的这是凑字数的这是凑字数的这是凑字数的这是凑字数的这是凑字数的这是凑字数的这是凑字数的这是凑字数的这是凑字数的

解

class Solution:
    def isPalindrome(self, x):
        """
        :type x: int
        :rtype: bool
        """
        if x < 0 or (x != 0 and x % 10 == 0):
            return False
        rev, y = 0, x
        while x > 0:
            rev = rev * 10 + x % 10
            x //= 10
        return y == rev

解

class Solution:
    def isPalindrome(self, x):
        """
        :type x: int
        :rtype: bool
        """
        if x < 0:
            return False
        elif x != int(str(x)[::-1]):
            return False
        else:
            return True