인프런 커뮤니티 질문&답변
작성한 질문수
안녕하세요! 이렇게 한번 풀어봤는데 안좋은 코드인가요??
작성
·
242
0
function solution(test) {
let answer = [];
for (let i = 0; i < test.length; i++) {
for (let j = 0; j < test[i].length - 1; j++) {
for (let k = j + 1; k < test[i].length; k++) {
if (answer.includes(`${test[i][j]},${test[i][k]}`)) continue;
if (answer.includes(`${test[i][k]},${test[i][j]}`)) {
answer.splice(answer.indexOf(`${test[i][k]},${test[i][j]}`), 1);
continue;
}
if (i !== 0) continue;
answer.push(`${test[i][j]},${test[i][k]}`);
}
}
}
return answer;
}
퀴즈
In a digit sum problem, among numbers with the same sum, what is the final answer?
The first discovered number
Max number
Smallest number
Anything is fine.
