-
Notifications
You must be signed in to change notification settings - Fork 0
/
solution0047N.js
55 lines (39 loc) · 1.49 KB
/
solution0047N.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
45
46
47
48
49
50
51
52
53
54
55
// 125. Valid Palindrome
// A phrase is a palindrome if, after converting all uppercase letters into lowercase letters and removing all non-alphanumeric characters, it reads the same forward and backward. Alphanumeric characters include letters and numbers.
// Given a string s, return true if it is a palindrome, or false otherwise.
// Example 1:
// Input: s = "A man, a plan, a canal: Panama"
// Output: true
// Explanation: "amanaplanacanalpanama" is a palindrome.
// Example 2:
// Input: s = "race a car"
// Output: false
// Explanation: "raceacar" is not a palindrome.
// Example 3:
// Input: s = " "
// Output: true
// Explanation: s is an empty string "" after removing non-alphanumeric characters.
// Since an empty string reads the same forward and backward, it is a palindrome.
// Constraints:
// 1 <= s.length <= 2 * 105
// s consists only of printable ASCII characters.
var isPalindrome = function(s) {
const newString = s.toLowerCase().replace(/[^a-z0-9]/g, '')
console.log(newString);
let left = 0;
let right = newString.length -1
while(left < right){
if(newString[left] !== newString[right]){
return false
}
left++
right--
}
return true
};
console.log(isPalindrome("A man, a plan, a canal: Panama"))
// var isPalindrome = function(s) {
// const newString = s.toLowerCase().replace(/[^a-z0-9]/g, '')
// let revString = newString.split("").reverse().join('')
// return revString === newString
// }