๊ด€๋ฆฌ ๋ฉ”๋‰ด

Daehyunii's Dev-blog

์ด์ง„ํŠธ๋ฆฌ ๋„“์ด ์šฐ์„  ํƒ์ƒ‰(BFS) ๋ณธ๋ฌธ

๐Ÿ“š Language & CS knowledge/Algorithm (๊ธฐ์ดˆ๋ฌธ์ œํ’€์ด)

์ด์ง„ํŠธ๋ฆฌ ๋„“์ด ์šฐ์„  ํƒ์ƒ‰(BFS)

Daehyunii 2022. 9. 7. 22:25

๋ฌธ์ œ(์ถœ์ฒ˜ : ์ธํ”„๋Ÿฐ ์ž๋ฐ”์Šคํฌ๋ฆฝํŠธ ์•Œ๊ณ ๋ฆฌ์ฆ˜ ๋ฌธ์ œํ’€์ด ๊ฐ•์˜, ์ •๋ณด์˜ฌ๋ฆผํ”ผ์•„๋“œ)

 

์•„๋ž˜ ๊ทธ๋ฆผ๊ณผ ๊ฐ™์€ ์ด์ง„ํŠธ๋ฆฌ๋ฅผ ๋„“์ด์šฐ์„ ํƒ์ƒ‰ํ•ด ๋ณด์„ธ์š”.

๋„“์ด ์šฐ์„  ํƒ์ƒ‰ : 1 2 3 4 5 6 7

 

Tip

 

๋ฌธ์ œํ’€์ด

//์ •๋‹ต
function solution(){  
    let answer="";
    let queue=[];
    queue.push(1);
    while(queue.length){
        console.log(queue);
        let v=queue.shift();
        answer+=v+" ";
        for(let nv of [v*2, v*2+1]){ 
            if(nv>7) continue;
            queue.push(nv);
        }
    }
    return answer;
}

console.log(solution());