[Algorithms] 15. Weave

문제

해결방법

제출 코드

class Queue {
  constructor() {
    this.data = [];
  }

  add(record) {
    this.data.unshift(record);
  }

  remove() {
    return this.data.pop();
  }
  
  peek() {
     return this.data[this.data.length -1]
  }
}

function weave(sourceOne, sourceTwo) {
    const q = new Queue();
    
    while(sourceOne.peek() || sourceTwo.peek()) {
    if (sourceOne.peek()) {
        q.add(sourceOne.remove());
    }        
    if(sourceTwo.peek()) {
        q.add(sourceTwo.remove());
    }
    }
    return q;
}