栈是一种先入先出的数据结构,主要操作包括出栈、入栈,出栈、入栈操作都是在对尾实现的,如下图:
JavaScript代码实现
function Stack(array) {
if (array instanceof Array) {
this.dataArray = array;
}else{
throw "'"+array+"' is not an Array";
}
};
Stack.prototype = function(){
Push:function(element){//进栈
this.dataArray.push(element);
},
Pop:function(){//出栈
return this.dataArray.pop();
},
IsEmpty:function(){//是否为空
return this.dataArray.length ==0;
},
Peek:function(){
},
Length:function(){//判断栈内元素个数
return this.dataArray.length;
},
Clear:function(){//清空栈
this.dataArray = new Array();
}
}