8000
We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent b263e11 commit 655a729Copy full SHA for 655a729
lib/src/easy/9.palindrome_number/problem.txt
@@ -1,8 +1,7 @@
1
9. Palindrome Number
2
https://leetcode.com/problems/palindrome-number/
3
4
-Given an integer x, return true if x is a
5
-palindrome, and false otherwise.
+Given an integer x, return true if x is a palindrome, and false otherwise.
6
7
8
Example 1:
@@ -15,7 +14,8 @@ Example 2:
15
14
16
Input: x = -121
17
Output: false
18
-Explanation: From left to right, it reads -121. From right to left, it becomes 121-. Therefore it is not a palindrome.
+Explanation: From left to right, it reads -121. From right to left, it becomes 121-.
+Therefore it is not a palindrome.
19
20
Example 3:
21
0 commit comments