数据结构TypeScript之栈和队列详解_其它

let a = [1, 2, 3, 4, 5]
a.pop() // 出栈操作
console.log(a) // [1，2，3，4]
a.push(6) // 入栈操作
console.log(a)// [1，2，3，4，6]

class Stack {
    length: number
    stack: any[]
    constructor() {
        this.length = 0
        this.stack = []
    }
    pop(): any {
        if (this.isEmpty()) {
            throw new Error('Stack is empty.')
        } else {
            return this.length-- && this.stack.pop()
        }
    }
    push(element: any): Stack {
        this.stack.push(element) && this.length++
        return this
    }
    isEmpty(): boolean {
        return this.length === 0
    }
}

let a = [1, 2, 3, 4, 5]
a.shift() // 出队操作
console.log(a) // [2, 3, 4, 5]
a.push(6) // 入队操作
console.log(a)// [2，3，4，5, 6]

class Queue {
    length: number
    queue: any[]
    constructor() {
        this.length = 0
        this.queue = []
    }
    dequeue(): any {
        if (this.isEmpty()) {
            throw new Error('Queue is empty.')
        } else {
            return this.length-- && this.queue.shift()
        }
    }
    enqueue(element: any): Queue {
        this.queue.push(element) && this.length++
        return this
    }
    isEmpty(): boolean {
        return this.length === 0
    }
}