[筆記] Master The Coding Interview – 12 @地瓜大的飛翔旅程

章節連結

課程相關資訊
範例程式碼
相關文章

這篇是 Udemy 上的知名課程 – Master the Coding Interview 的部分進修心得。這篇對應的內容是「Data Structures: Stacks + Queues」關於堆疊和序列的第三部分簡介。

課程對應章節：118~121

請注意：本系列文章為個人對應課程的消化吸收後，所整理出來的內容。換言之，並不一定會包含全部的課程內容，也有可能會添加其他資源來說明。

範例程式碼

class Node {
  constructor(value) {
    this.value = value;
    this.next = null;
  }
}

class Queue {
  constructor(){
    this.first = null;
    this.last = null;
    this.length = 0;
  }
  peek() {
    return this.first
  }
  enqueue(value){
    const newNode = new Node(value)
    if(this.length === 0){
       this.first = newNode
       this.last = newNode
    }else{
       this.last.next = newNode
       this.last = newNode
    }
    this.length++
    return this
  }
  dequeue(){
    if(!this.first){
      return null
    }
    if(this.first === this.last){
      this.last = null
    }
    const holdingPointer = this.first;
    this.first = this.first.nect
    this.length--
    return this
  }
}

const myQueue = new Queue();
myQueue.peek();
myQueue.enqueue('Joy');
myQueue.enqueue('Matt');
myQueue.enqueue('Pavel');
myQueue.peek();
myQueue.dequeue();
myQueue.dequeue();
myQueue.dequeue();
myQueue.peek();

class Node {

constructor(value) {

this.value = value;

this.next = null;

}

class Queue {

constructor(){

this.first = null;

this.last = null;

this.length = 0;

}

peek() {

return this.first

}

enqueue(value){

const newNode = new Node(value)

if(this.length === 0){

this.first = newNode

this.last = newNode

}else{

this.last.next = newNode

this.last = newNode

}

this.length++

return this

}

dequeue(){

if(!this.first){

return null

}

if(this.first === this.last){

this.last = null

}

const holdingPointer = this.first;

this.first = this.first.nect

this.length--

return this

}

const myQueue = new Queue();

myQueue.peek();

myQueue.enqueue('Joy');

myQueue.enqueue('Matt');

myQueue.enqueue('Pavel');

myQueue.peek();

myQueue.dequeue();

myQueue.peek();