๐Ÿ‘’ ๋ญ? JS๋กœ PS๋ฅผ ํ•œ๋‹ค๊ณ ?

[ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค][Javascript / JS] ๊ทค ๊ณ ๋ฅด๊ธฐ

์„ ๋‹ฌ 2023. 5. 8. 23:52
๋ฐ˜์‘ํ˜•

https://school.programmers.co.kr/learn/courses/30/lessons/138476

 

ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค

์ฝ”๋“œ ์ค‘์‹ฌ์˜ ๊ฐœ๋ฐœ์ž ์ฑ„์šฉ. ์Šคํƒ ๊ธฐ๋ฐ˜์˜ ํฌ์ง€์…˜ ๋งค์นญ. ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค์˜ ๊ฐœ๋ฐœ์ž ๋งž์ถคํ˜• ํ”„๋กœํ•„์„ ๋“ฑ๋กํ•˜๊ณ , ๋‚˜์™€ ๊ธฐ์ˆ  ๊ถํ•ฉ์ด ์ž˜ ๋งž๋Š” ๊ธฐ์—…๋“ค์„ ๋งค์นญ ๋ฐ›์œผ์„ธ์š”.

programmers.co.kr

 

function solution(k, tangerine) {
    var map = new Map();
    for(var weight of tangerine) {
        if(map.has(weight)) {
            map.set(weight, map.get(weight)+1);
        } else {
            map.set(weight, 1);
        }
    }
    var ans = 0;
    var countArr = [...map].map((pair) => pair[1]).sort((a,b) => b - a);
    for(var weight of countArr) {
        k -= weight;
        ans++;
        if(k<=0) return ans;
    }
}
๋ฐ˜์‘ํ˜•