Permalink
Cannot retrieve contributors at this time
Name already in use
A tag already exists with the provided branch name. Many Git commands accept both tag and branch names, so creating this branch may cause unexpected behavior. Are you sure you want to create this branch?
LeetCode/palindrome-number
Go to fileThis commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
42 lines (35 sloc)
1006 Bytes
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
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. | |
My code: | |
class Solution: | |
def isPalindrome(self, x): | |
""" | |
:type x: int | |
:rtype: bool | |
""" | |
if x<0: | |
return False | |
if x==0: | |
return True | |
tmp_list=[] | |
while x!=0: | |
result=x%10 | |
x=(x-result)/10 | |
tmp_list.append(result) | |
for i in range(len(tmp_list)): | |
index=len(tmp_list)-i-1 | |
if tmp_list[i]!=tmp_list[index]: | |
return False | |
return True | |
Solution: | |
https://leetcode.com/problems/palindrome-number/ |