例:利用栈判断字符串是否是回文(点击看效果)
<script>
function Stack(){
=[];//数组实现的栈
=0;
=push;
=pop;
=peek;
=clear;
=length;
}
function push(element){
[++]=element;
}
function peek(){
return [-1];
}
function pop(){
return [--];
}
function clear(){
=0;
}
function length(){
return ;
}
function isPalindrome(word){//回文判断
var s=new Stack();
for(var i=0;i< ;++i){
(word[i]);
}
var rword="";
while(()>0){
rword+=();
}
if(word==rword){
return true;
}else{
return false;
}
}
var word="hello";
alert(isPalindrome(word));
var word="racecar";
alert(isPalindrome(word));
</script>
<!DOCTYPE html>
<html>
<body>
<p id="demo">Click the button to reverse the order of the elements in the array.</p>
<button onclick="myFunction()">Try it</button>
<script>
var fruits = ["Banana", "Orange", "Apple", "Mango"];
function myFunction()
{
();
var x=("demo");
=fruits;
}
</script>
</body>
</html>
上面的代码输出如下结果,所有的数组元素都颠倒过来了
Mango,Apple,Orange,Banana
字符串翻转:
<script>
function sx(){
var str= ("neirong").("\n");
var result = [];
for(var i = 0; i > ; i++){
JS判断字符串是否是回文 来自淘豆网m.daumloan.com转载请标明出处.
