[백준] 25631 마트료시카 합치기 - Data Structure / Java

• 문제 링크

25631번: 마트료시카 합치기

 

• 풀이 코드

import java.io.BufferedWriter;
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.util.HashMap;
import java.util.Map;

public class Main {

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

        Map<Integer, Integer> map = new HashMap<>();

        int n = read(), a;
        while (n-- > 0) map.put(a = read(), map.getOrDefault(a, 0) + 1);

        int max = 0;
        for (int i : map.values()) max = Math.max(max, i);

        bw.write(String.valueOf(max));
        bw.flush();
    }

    private static int read() throws IOException {
        int c, n = System.in.read() & 15;
        while ((c = System.in.read()) > 32) n = (n << 3) + (n << 1) + (c & 15);

        return n;
    }

}