feat: update solutions to leetcode problem: No.0009

yanglbme · yanglbme · commit cb0c4f492d12 · 2021-02-13T23:57:06.000+08:00
diff --git a/solution/0000-0099/0009.Palindrome Number/README.md b/solution/0000-0099/0009.Palindrome Number/README.md
@@ -42,15 +42,33 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def isPalindrome(self, x: int) -> bool:
+        if x < 0:
+            return False
+        y, t = 0, x
+        while t:
+            y = y * 10 + t % 10
+            t //= 10
+        return x == y
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+class Solution {
+    public boolean isPalindrome(int x) {
+        if (x < 0) return false;
+        int y = 0, t = x;
+        while (t != 0) {
+            y = y * 10 + t % 10;
+            t /= 10;
+        }
+        return x == y;
+    }
+}
 ```
 
 ### **...**
diff --git a/solution/0000-0099/0009.Palindrome Number/README_EN.md b/solution/0000-0099/0009.Palindrome Number/README_EN.md
@@ -51,13 +51,31 @@
 ### **Python3**
 
 ```python
-
+class Solution:
+    def isPalindrome(self, x: int) -> bool:
+        if x < 0:
+            return False
+        y, t = 0, x
+        while t:
+            y = y * 10 + t % 10
+            t //= 10
+        return x == y
 ```
 
 ### **Java**
 
 ```java
-
+class Solution {
+    public boolean isPalindrome(int x) {
+        if (x < 0) return false;
+        int y = 0, t = x;
+        while (t != 0) {
+            y = y * 10 + t % 10;
+            t /= 10;
+        }
+        return x == y;
+    }
+}
 ```
 
 ### **...**
diff --git a/solution/0000-0099/0009.Palindrome Number/Solution.java b/solution/0000-0099/0009.Palindrome Number/Solution.java
@@ -1,14 +1,11 @@
 class Solution {
     public boolean isPalindrome(int x) {
-        if (x < 0) {
-            return false;
+        if (x < 0) return false;
+        int y = 0, t = x;
+        while (t != 0) {
+            y = y * 10 + t % 10;
+            t /= 10;
         }
-        int res = 0;
-        int y = x;
-        while (y != 0) {
-            res = res * 10 + y % 10;
-            y /= 10;
-        }
-        return res == x;
+        return x == y;
     }
 }
diff --git a/solution/0000-0099/0009.Palindrome Number/Solution.py b/solution/0000-0099/0009.Palindrome Number/Solution.py
@@ -1,10 +1,9 @@
 class Solution:
-    def isPalindrome(self, num):
-        """
-        :type num: int
-        :rtype: bool
-        """
-        if num < 0:
+    def isPalindrome(self, x: int) -> bool:
+        if x < 0:
             return False
-        
-        return str(num) == str(num)[::-1]
+        y, t = 0, x
+        while t:
+            y = y * 10 + t % 10
+            t //= 10
+        return x == y
