[백준] 20937 떡국 - Greedy / Java

• 문제 링크

20937번: 떡국

 

• 풀이 과정

 

• 풀이 코드

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.Collections;
import java.util.HashMap;
import java.util.Map;
import java.util.StringTokenizer;

public class Main {

    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));

        int n = Integer.parseInt(br.readLine());
        StringTokenizer st = new StringTokenizer(br.readLine());

        Map<String, Integer> map = new HashMap<>();
        while (n-- > 0) {
            String key = st.nextToken();
            map.put(key, map.getOrDefault(key, 0) + 1);
        }

        bw.write(String.valueOf(Collections.max(map.values())));
        bw.flush();
    }

}