[2020. 10. 20 TIL] Data Structure - Stack, Queue

Stackの定義

Property

Method

class Stack {
  constructor() {
    this.storage = {};
    this.top = 0;
  }

  size() {
    return this.top;
  }

  push(element) {
    this.storage[this.top] = element;
    this.top++;
  }

  pop() {
    let topVal = this.storage[this.top-1];
    delete this.storage[this.top-1];

    if(this.top > 0){
      this.top--;
    }

    return topVal;
  }
}

Queueの定義

class Queue {
  constructor() {
    this.storage = {};
    this.front = 0;
    this.rear = 0;
  }

  size() {
    return this.rear;
  }

  enqueue(element) {
    this.storage[this.rear] = element;
    this.rear++;
  }

  dequeue() {
    let frontVal = this.storage[this.front];
    delete this.storage[this.front];

    for(let i=1 ; i<this.rear ; i++){
      let curr = this.storage[i];
      this.storage[i-1] = curr;
    }

    if(this.rear > 0){
      this.rear--;
    }
    delete this.storage[this.rear];
    return frontVal;
  }
}