JavaScript栈的实现

        //创建一个类来表示栈
        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];
            };
            //栈为空返回0，否则返回false
            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(5);
        stack.push(8);
        //console.log(stack.peek());
        stack.push(11);
        //console.log(stack.size());
        //console.log(stack.isEmpty());
        stack.push(15);
        stack.pop();
        stack.pop();
        console.log(stack.size());
        stack.print();