feat: update js solution to lc problem: No.0125

No.0125.Valid Palindrome

Author: YangFong

solution/0100-0199/0125.Valid Palindrome/README.md

@@ -140,7 +140,11 @@ public class Solution {
 ### **JavaScript**
 
 ```js
-const isPalindrome1 = function (s) {
+/**
+ * @param {string} s
+ * @return {boolean}
+ */
+var isPalindrome = function (s) {
     let arr1 = [],
         arr2 = [];
     for (let i = 0; i < s.length; i++) {
@@ -155,8 +159,14 @@ const isPalindrome1 = function (s) {
     arr2.reverse();
     return arr1.join('') === arr2.join('');
 };
+```
 
-const isPalindrome = function (s) {
+```js
+/**
+ * @param {string} s
+ * @return {boolean}
+ */
+var isPalindrome = function (s) {
     function isNumOrAl(a) {
         if (
             (a >= 'A' && a <= 'Z') ||
@@ -216,6 +226,16 @@ function isPalindrome(s: string): boolean {
 }
 ```
 
+```ts
+function isPalindrome(s: string): boolean {
+    const isAlphanumeric = (c: string) => {
+        return (c >= 'a' && c <= 'z') || (c >= '0' && c <= '9');
+    };
+    const cs = s.toLocaleLowerCase().split('').filter(isAlphanumeric);
+    return cs.join('') === cs.reverse().join('');
+}
+```
+
 ### **Rust**
 
 ```rust

solution/0100-0199/0125.Valid Palindrome/README_EN.md

@@ -139,7 +139,11 @@ public class Solution {
 ### **JavaScript**
 
 ```js
-const isPalindrome1 = function (s) {
+/**
+ * @param {string} s
+ * @return {boolean}
+ */
+var isPalindrome = function (s) {
     let arr1 = [],
         arr2 = [];
     for (let i = 0; i < s.length; i++) {
@@ -154,8 +158,14 @@ const isPalindrome1 = function (s) {
     arr2.reverse();
     return arr1.join('') === arr2.join('');
 };
+```
 
-const isPalindrome = function (s) {
+```js
+/**
+ * @param {string} s
+ * @return {boolean}
+ */
+var isPalindrome = function (s) {
     function isNumOrAl(a) {
         if (
             (a >= 'A' && a <= 'Z') ||
@@ -215,6 +225,16 @@ function isPalindrome(s: string): boolean {
 }
 ```
 
+```ts
+function isPalindrome(s: string): boolean {
+    const isAlphanumeric = (c: string) => {
+        return (c >= 'a' && c <= 'z') || (c >= '0' && c <= '9');
+    };
+    const cs = s.toLocaleLowerCase().split('').filter(isAlphanumeric);
+    return cs.join('') === cs.reverse().join('');
+}
+```
+
 ### **Rust**
 
 ```rust

solution/0100-0199/0125.Valid Palindrome/Solution.js

@@ -1,4 +1,8 @@
-const isPalindrome1 = function (s) {
+/**
+ * @param {string} s
+ * @return {boolean}
+ */
+var isPalindrome = function (s) {
     let arr1 = [],
         arr2 = [];
     for (let i = 0; i < s.length; i++) {
@@ -13,38 +17,3 @@ const isPalindrome1 = function (s) {
     arr2.reverse();
     return arr1.join('') === arr2.join('');
 };
-
-const isPalindrome = function (s) {
-    function isNumOrAl(a) {
-        if (
-            (a >= 'A' && a <= 'Z') ||
-            (a >= '0' && a <= '9') ||
-            (a >= 'a' && a <= 'z')
-        ) {
-            return true;
-        } else {
-            return false;
-        }
-    }
-
-    if (s.length === 0) {
-        return true;
-    }
-    let i = 0,
-        j = s.length - 1;
-    while (i < j) {
-        while (i < j && !isNumOrAl(s[i])) {
-            i++;
-        }
-        while (i < j && !isNumOrAl(s[j])) {
-            j--;
-        }
-        if (s[i].toLowerCase() !== s[j].toLowerCase()) {
-            return false;
-        } else {
-            i++;
-            j--;
-        }
-    }
-    return true;
-};