栈结构的实现
export class Stack {
constructor() {
this.stack = [];
}
push(item) {
this.stack.push(item);
}
pop() {
return this.stack.pop();
}
size() {
return this.stack.length;
}
peek() {
return this.stack[this.size() - 1];
}
clear() {
this.stack = [];
}
isEmpty() {
return this.size() == 0;
}
}
队列结构的实现
export class Queue {
constructor() {
this.queue = [];
}
enQueue(item) {
this.queue.push(item);
}
deQueue() {
return this.queue.shift();
}
head() {
return this.queue[0];
}
tail() {
return this.queue[this.size() - 1];
}
size() {
return this.queue.length;
}
clear() {
this.queue = [];
}
isEmpty() {
return this.size() == 0;
}
}