int length = str.length(); String s1 = ""; String s2 = ""; if (length%2==0) { s1 = str.substring(0, (length/2)); s2 = str.substring(length/2, length); } else { s1 = str.substring(0, ((length-1)/2)); s2 = str.substring((length+1)/2, length); } s2 = new String(new StringBuffer(s2).reverse()); if (s1.equals(s2)) { System.out.println("YES"); } else { System.out.println("NO"); }算法是不会的,之后抠代码
var str = 'abcacba'; for (var i in str) { var k = str.length - 1 - i; console.log(str[i], '---', str[k]); if(i>=k){ console.log('是回文'); break; } if (str[i] != str[k]) { console.log('不是回文'); break; } }
}