【LeetCode】9. Palindrome Number

Introduction

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?

Solution

class Solution(object):
    def isPalindrome(self, x):
        """
        :type x: int
        :rtype: bool
        """
        x = str(x)
        out = True
        for i in range(len(x)/2):
            if x[i] == x[len(x)-1-i]:
                continue
            else:
                out = False
                break
        return out

https://leetcode.com/submissions/detail/202027004/

Code

GitHub:https://github.com/roguesir/LeetCode-Algorithm

  • 更新時間:2019-03-01
發表評論
所有評論
還沒有人評論,想成為第一個評論的人麼? 請在上方評論欄輸入並且點擊發布.
相關文章