栈的实现

实现简单，不多解释了，使用数组来保存数据

function Stack () {var items = [];//入栈this.push = function (item) {items.push(item);}// 出栈this.pop = function () {return items.pop();}// 返回栈顶的元素this.peek = function () {return items[items.length - 1];}// 判断栈是否为空this.isEmpty = function () {return items.length == 0}// 清栈this.clear = function () {items = [];}// 栈的大小this.size = function () {return items.length}// 打印栈的内容this.print = function () {console.log(items);}}