master

分支 (1)

管理

管理

master

Leetcode-js
/
125.验证回文串.html

<!DOCTYPE html>
<html lang="en">
<head>
    <meta charset="UTF-8">
    <meta name="viewport" content="width=device-width, initial-scale=1.0">
    <meta http-equiv="X-UA-Compatible" content="ie=edge">
    <title>Document</title>
</head>
<body>
    <script>
       var isPalindrome = function(s) {
          let flag = true;
          let arr = s.split("");
          let newarr = [];
          arr.map(
             (i)=>{
                 if((i>='a'&&i<="z")||(i>="A"&&i<='Z')||(i>='0'&&i<='9')){
                   let c = i.toUpperCase();
                   newarr.push(c);
                 }
             }
          )
          for(let i=0;i<=newarr.length/2;i++){
               if(newarr[i]!=newarr[newarr.length-1-i]){
                 flag = false;
                 break;
               }
          }
          return flag;
      };
      alert(isPalindrome("0p"));
    </script>
</body>
</html>