[백준 15649번] 백트래킹 - N과 M (1)

✨ 문제 ✨

✨ 정답 ✨

const { notDeepEqual } = require("assert");
const { count } = require("console");
const fs = require("fs");
const { nextTick } = require("process");
const { start } = require("repl");
const filePath = process.platform === "linux" ? "/dev/stdin" : "./예제.txt";
let input = fs.readFileSync(filePath).toString().trim().split('\n');


// const fs = require('fs'); 
// let input = fs.readFileSync("/dev/stdin").toString().trim().split('\n');



const [N,M]=input.shift().split(' ').map((el)=>+el)

let visited=new Array(N+1).fill(false);
let answer=[];
let printAnswer=[];
const DFS=(count)=>{
    if(count===M){
        printAnswer.push(answer.join(' '))
        return;
    }
    for (let i=1;i<=N;i++){
        if (visited[i]===true){
            continue;
        }
        visited[i]=true;
        answer.push(i);
        DFS(count+1);
        answer.pop();
        visited[i]=false;
    }
}

DFS(0)
console.log(printAnswer.join('\n'))

🧵 참고한 정답지 🧵

https://kimbangg.tistory.com/207

💡💡 기억해야 할 점 💡💡