<script type="text/javascript"> const _isPalindrome = string => { // 补全代码 return string === string.split('').reverse().join(''); } </script>方法二:左右指针。
<script type="text/javascript"> const _isPalindrome = string => { // 补全代码 // 左指针、右指针 var left = 0; var right = string.length - 1; // 对称依次对比 while(left < right) { if(string[left++] !== string[right--]) { return false; } } // 全部对比结束,均相等 return true; } </script>
<script type="text/javascript"> const _isPalindrome = string => { // 补全代码 let left = 0 let right = string.length - 1 while(left < right ) { if(string[left++] !== string[right--]) { return false } } return true } </script>
const _isPalindrome = string => { // 补全代码 let arr1 = Array.from(string) let arr2 = Array.from(string).reverse() return arr1.every((item,index) => { return item === arr2[index] }) }
const _isPalindrome = string => { // 补全代码 let strArr = string.split(','); let len = strArr.length; if(len%2!==0){ let mid = Math.floor(len/2); let l = r = mid; while(l>0){ if(strArr[l] !== strArr[r]){ return false; }else{ l--; r++; continue; } } return true; } }
for (let i = 0; i <= Math.floor(string.length/2); i++) { if(string[i]==string[string.length-i-1]){ if(i==Math.floor(string.length/2)){ return true } }else{ return false } }
<script type="text/javascript"> const _isPalindrome = string => { // 补全代码 let resever = string.split('').reverse() return resever.join('') == string ? true : false } </script>
<!DOCTYPE html> <html> <head> <meta charset=utf-8> </head> <body> <script type="text/javascript"> const _isPalindrome = string => { // 补全代码 let length = string.length; for(let i=0;i<Math.floor(length/2);i++){ if(string[i]!=string[length-1-i]) return false; } return true; } </script> </body> </html>