js实现栈

js实现栈的基本操作

function Stack() {
    this.dataStore = [];
    this.top = 0;//栈顶
    this.push = push;//入栈
    this.pop = pop;//出栈
    this.isEmpty = isEmpty;//判断是否为空
    this.peek = peek;//取栈顶元素
    this.length = length;//栈的长度
    this.clear = clear;//栈的清空
}
function push(val) {
    this.dataStore[this.top++] = val;
}
function pop() {
    if (!this.isEmpty()) {
        this.top--;
        return this.dataStore.pop();
    } else {
        return null;
    }
}
function isEmpty() {
    return this.top === 0;
}
function peek() {
    if (!this.isEmpty()) {
        return this.dataStore[this.top - 1];
    } else {
        return null;
    }
}
function length() {
    return this.top;
}
function clear() {
    this.dataStore = [];
    this.top = 0;
}
var stk = new Stack();//调用