用Python3实现LeetCode算法题系列——No.009 Palindrome Number [Easy]

版权声明：转载请注明来源！ https://blog.csdn.net/CAU_Ayao/article/details/82084873

目录

---

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.

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

---

2. 提交的代码

        x = str(x)
        xx = x[::-1]
        if x == xx:
            return True
        else:
            return False

3. 运行效果

4. 完整代码

class Solution:
    def isPalindrome(self, x):
        x = str(x)
        xx = x[::-1]
        if x == xx:
            return True
        else:
            return False
        """
        :type x: int
        :rtype: bool
        """
def main():
    import sys
    def readlines():
        for line in sys.stdin:
            yield line.strip('\n')

    lines = readlines()
    while True:
        try:
            line = next(lines)
            x = int(line);

            ret = Solution().isPalindrome(x)

            out = (ret);
            print(out)
        except StopIteration:
            break


if __name__ == '__main__':
    main()