js数据结构预算法——队和栈

function Queue (){

var items = [];

this. enqueue= function ( element){

items. push( element);

};

this. dequeue= function (){

return items. shift();

};

this. front= function(){

return items[ 0];

};

this. isEmpty= function(){

return items. length== 0;

};

this. size= function(){

return items. length;

};

this. print = function () {

console. log( items. toString());

};

}

var queue= new Queue();

queue. enqueue( 3);

queue. enqueue( 8908);

queue. enqueue( "guanguan");

queue. print();

console. log( queue. size());

---------------------------------------------------------------------------------------------

function Stack (){

var items=[];

this. push= function( element){

items. push( element);

};

this. pop= function(){

return items. pop();

};

this. peek= function(){

return items[ items. length- 1];

};

this. isEmpty= function(){

return items. length== 0;

};

this. size= function(){

return items. length;

};

this. clear= function(){

items=[];

};

this. print = function(){

console. log( items. toString());

};

}

var stack= new Stack();

console. log( stack. isEmpty());

stack. push( 3);

stack. push( 4);

stack. print();

console. log( stack. size());

console. log( stack. isEmpty());

stack. pop();

stack. pop();

console. log( stack. isEmpty());

stack. push( 3);

stack. push( 9);

stack. clear();

console. log( stack. isEmpty());