ts-ds-tool/src/stack/Stack.ts

Data structure and algorithm of TypeScript

import { Collection } from "../Collection";
import LinkList from "../linklist/LinkList";
export class Stack<T> extends Collection<T> {
    private linkList: LinkList<T>;
    constructor(){
        super();
        this.linkList = new LinkList();
    }
    /**
     * 压栈
     * @param node
     */
    public push(node: T){
        return this.linkList.append(node);
    }

    /**
     * 出栈
     *
     */
    public pop(){
        const node = this.linkList.pop();
        if (node) {
            return node.Value;
        }
        return null;
    }

    /**
     * 查看栈顶元素
     */
    public peek(){
        if (!this.linkList.getTailNode()){
            return null;
        }
        return this.linkList.getTailNode().Value;
    }

    /**
     * 空栈
     */
    public isEmpty(){
        return !this.linkList.getTailNode();
    }

    public toString(){
        return this.linkList.toString();
    }

    protected __iterate(fn: (item: T, index: number) => void): void {
        let temp = this.linkList.getHeadNode(),
            index = 0;
        while (temp){
            fn(temp.Value, index);
            index++;
            temp = temp.Next;
        }
    }

    public toArray(){
        return super.toArray().reverse();
    }
}

export default Stack;