📰 Queue 알아보기

선언

class Queue {
    constructor(arr) {
        this.queue = [...arr];
        this.front = 0;
        this.back = arr.length - 1;
    }
    dequeue() {
        const value = this.queue[this.front];
        delete this.queue[this.front];
        this.front++;
        return value;
    }
    isEmpty() {
        return this.front === this.back;
    }
    show() {
        return this.queue;
    }
}

사용 (프로그래머스, 문자열 섞기)

function solution(str1, str2) {
    const arr1 = str1.split("");
    const arr2 = str2.split("");
    const queue1 = new Queue([...str1]);
    const queue2 = new Queue([...str2]);

    let answer = arr1.slice().reduce((acc, curr) => {
        const a = queue1?.dequeue() ?? ""
        const b = queue2?.dequeue() ?? "";
        return acc + a + b ;
    }, "")

    if(arr2.length > 0 ) {
        const remain = queue2.show().join("");
        answer += remain;
    }
    return answer;
}