[LeetCode][python3]0009. Palindrome Number

  1. My first solution
class Solution:
def isPalindrome(self, x: int) -> bool:
if str(x)== str(x)[::-1]:
return True
else:
return False
N2I -2020.03.16

--

--

--

HI I’m N2I. Now a SWE in Taiwan. Check out more about me in https://nzi2020.blogspot.com/ or contact via email: nayzi9999@gmail.com

Love podcasts or audiobooks? Learn on the go with our new app.

Recommended from Medium

How to integrate SCADA into scalable data analytics

Web Security 03 — X Powered By / Server

Ngrok for Local Development

When and how to estimate Time in Software development?

How to Use Kudan and echoAR for Markerless Tracking

READ/DOWNLOAD*] SharePoint 2013 Unleashed FULL BOO

Best solutions for Amazon interview tasks. Top K Frequently Mentioned Keywords

My heavily customized Gitconfig with all the bells and whistles

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store
N2I

N2I

HI I’m N2I. Now a SWE in Taiwan. Check out more about me in https://nzi2020.blogspot.com/ or contact via email: nayzi9999@gmail.com

More from Medium

Implementing Linked List Operations in Python

The Tortoise and Hare method to find the middle element of the linked list

LeetCode #167 | Two Sum II — Input Array Is Sorted (Python)

Build Array from Permutation — Day 103(Python)