关于javascript:javascript-数据结构系列-三-栈

明天持续javascript 数据结构系列,明天讲的次要是数据结构栈 statck.

首先实现栈 构造函数,代码如下

export default class Stack {  constructor() {    // We're going to implement Stack based on LinkedList since these    // structures are quite similar. Compare push/pop operations of the Stack    // with prepend/deleteHead operations of LinkedList.    this.linkedList = new LinkedList();  }}

其次，实现栈的第一个办法查看栈是否为空

  /**   * @return {boolean}   */  isEmpty() {    // The stack is empty if its linked list doesn't have a head.    return !this.linkedList.head;  }

peek 办法

  /**   * @return {*}   */  peek() {    if (this.isEmpty()) {      // If the linked list is empty then there is nothing to peek from.      return null;    }    // Just read the value from the start of linked list without deleting it.    return this.linkedList.head.value;  }

push 办法

  /**   * @param {*} value   */  push(value) {    // Pushing means to lay the value on top of the stack. Therefore let's just add    // the new value at the start of the linked list.    this.linkedList.prepend(value);  

pop 办法

  /**   * @return {*}   */  pop() {    // Let's try to delete the first node (the head) from the linked list.    // If there is no head (the linked list is empty) just return null.    const removedHead = this.linkedList.deleteHead();    return removedHead ? removedHead.value : null;  }

至此，一个简略stack就实现了，欢送大家提出问题，进行交换!