栈 LIFO:后进先出 class Stack<T> { private items:T[] constructor(){ this.items = [] } // 从栈顶放入元素 push(...element:T[]):void { this.items.push(...element) } // 从栈顶取出元素 pop():T {