9. Palindrome Number(easy)

Given an integer x, return true if x is palindrome integer.

An integer is a palindrome when it reads the same backward as forward. For example, 121 is palindrome while 123 is not.

Example 1:
Input: x = 121
Output: true

Example 2:
Input: x = -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: x = 10
Output: false
Explanation: Reads 01 from right to left. Therefore it is not a palindrome.

Example 4:
Input: x = -101
Output: false

Constraints:
-231 <= x <= 231 - 1

My solution

class Solution:
    def isPalindrome(self, x: int) -> bool:

        num = str(x)
        reverse = num[::-1]

        if num==reverse:
            return True
        else:
            return False

以下是在討論區看到別人的做法

def isPalindrome(self, x: int) -> bool:
	if x<0:
		return False

	inputNum = x
	newNum = 0
	while x>0:
		newNum = newNum * 10 + x%10
		x = x//10
	return newNum == inputNum

Result

今天偷懶只寫了一題easy的
而且還使用了小作弊的方法

明天要進去實驗室了
今天在進行收心操的部分
祝我順利

也希望大家連假後的明天都順利！！