[완전탐색]알고리즘 with Node.js

const a = [0];



function solution(numbers) {
	//

    let answer = '';

    numbers.sort().reverse();

    answer = combin(numbers, '');

    return answer;

};



function combin(data, str) {
    //
    let num = new Array;

    if (data.length) {
        //
        for (let i in data) {
            //
            num = [...data];
            num.splice(i, 1);
            combin(num, str + data[i]);
        };
	};

if (str > a[0]) a.splice(0, 1, str);

return a[0];

};