leedCode练题——9. Palindrome Number

Posted smart-cat

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了leedCode练题——9. Palindrome Number相关的知识,希望对你有一定的参考价值。

1、题目
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.

Follow up:

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



2、我的解法

# -*- coding: utf-8 -*-
# @Time : 2020/1/27 17:28
# @Author : SmartCat0929
# @Email : 1027699719@qq.com
# @Link : https://github.com/SmartCat0929
# @Site :
# @File : 9. Palindrome Number.py

class Solution:
def isPalindrome(self, x: int) -> bool:
if x > 0:
r = 0
y = str(x)
n = len(y)
d = []
for i in (y):
d.append(i)
for j in range(n):
c = d.pop()
r = r + c
v = int(r)
if v == x:
return v
else:
return 0
elif x== 0:
return True
else:
return 0


print(Solution().isPalindrome(12321))

以上是关于leedCode练题——9. Palindrome Number的主要内容,如果未能解决你的问题,请参考以下文章

leedCode练题——12. Integer to Roman

leedCode练题——21. Merge Two Sorted Lists(照搬大神做法)

[LeedCode]279. 完全平方数

9. Palindrome Number

leetcode 9. palindrome number

9. Palindrome Number