【算法】js封装栈和队列

163 阅读1分钟
function Stack() {
	this.arr = [];
	this.push = function(value) {
		this.arr.push(value);
	}
	this.pop = function() {
		return this.arr.pop();
	}
}
function Queue() {
	this.arr = [];
	this.push = function(value) {
		this.arr.push(value);
	}
	this.shift = function() {
		return this.arr.shift();
	}
}
const stack = new Stack();
stack.push(1)
stack.push(2)
stack.push(3)
console.log(stack.arr)
stack.pop()
stack.pop()
console.log(stack.arr)

const queue = new Queue();
queue.push(1)
queue.push(2)
queue.push(3)
console.log(queue.arr)
queue.shift()
queue.shift()
console.log(queue.arr)