-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path20nov22Palindrome.js
44 lines (30 loc) · 938 Bytes
/
20nov22Palindrome.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
Given an integer x, return true if x is a
palindrome
, and false otherwise.
Example 1:
Input: x = 121
Output: true
Explanation: 121 reads as 121 from left to right and from right to left.
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.
Constraints:
-231 <= x <= 231 - 1
/**
* @param {number} x
* @return {boolean}
*/
var isPalindrome = function(x) {
//x is int.
//return bool if x reads the same reverse
// x = 121. x.reverse === 121 => true
// x = -88. x.reverse === 88- -> false
//convert the int to string, then compare
return (String(x) === String(x).split('').reverse().join(''))
};
Follow up: Could you solve it without converting the integer to a string?