몽땅뚝딱 개발자

https://frontend-fundamentals.com/code/

보호되어 있는 글입니다.

function solution(number, k) { const result = []; for (let i=0; i 0 && result[result.length - 1] 0) { k--; result.pop(); } result.push(number[i]); } result.splice(number.length - k, k); return result.join("");}

function solution(people, limit) { people.sort((a, b) => a - b) let count = 0 while (people.length !== 0) { if (people[0] + people[people.length-1]