Press n or j to go to the next uncovered block, b, p or k for the previous block.
| 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 | 1x 1x 1x 1x 1x 1x 8x 8x 1x 1x 1x 1x 1x 1x 8x 8x 1x 1x 3x 3x 1x | // LIFO implementation
// @src https://basarat.gitbook.io/algorithms/datastructures/stack
export class Stack<Element> {
private readonly store: Element[] = [];
public push(item: Element): number {
return this.store.push(item);
}
public pop(): Element | undefined {
return this.store.pop();
}
public size(): number {
return this.store.length;
}
public peek(): Element | null {
return this.store[this.store.length - 1] != null ? this.store[this.store.length - 1] : null;
}
}
|