[programmers][X] 귤 고르기

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

문제좀 잘 보자..

import java.util.*;

class Solution {
    public int solution(int k, int[] tangerine) {
        int answer = 0;

        HashMap<Integer,Integer> m = new HashMap<>();

        for(int t : tangerine){
            m.put(t, m.getOrDefault(t,0) + 1);
        }

        List<Integer> l = new ArrayList<>(m.keySet());

        Collections.sort(l,(o1,o2) -> {
            return m.get(o2) - m.get(o1);
        });

        int sum = 0;
        for(int key : l){
            answer++;
            sum += m.get(key);
            if(k <= sum) return answer;
        }

        return answer;
    }
}

© 2023 Lee. All rights reserved.