使用ts实现了一个自己的栈

基于上次实现的数组，实现了一个栈结构。

import MyArray from "../Array/array";

interface Stack<E> {
  getSize(): number;
  
  isEmpty(): boolean;
  
  push(e: E): void;
  
  pop(): E;
  
  peek(): E;
}

export default class ArrayStack<E> implements Stack<E> {
  private array: MyArray<E>;
  
  constructor(capacity: number = 10) {
    this.array = new MyArray<E>(capacity);
  }
  
  public getSize(): number {
    return this.array.getSize();
  }
  
  public isEmpty(): boolean {
    return this.array.isEmpty();
  }
  
  public peek(): E {
    return this.array.getLast();
  }
  
  public pop(): E {
    return this.array.removeLast();
  }
  
  public push(e: E): void {
    this.array.addLast(e);
  }
  
  public getCapacity(): number {
    return this.array.getCapacity();
  }
  
  public toString(): string {
    let res: string = `Stack: `;
    res += '[';
    for (let i = 0; i < this.array.getSize(); i++) {
      res += this.array.get(i);
      if (i != this.array.getSize() - 1) {
        res += ', ';
      }
    }
    res += '] top'
    return res;
  }
  
}