[백준] 10689 Hamza - Data Structure / Java

• 문제 링크

https://www.acmicpc.net/problem/10689

 

• 풀이 코드

import java.io.BufferedWriter;
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.util.HashSet;
import java.util.Set;

public class Main {

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

        Set<Integer> set = new HashSet<>();

        int n = read();
        for (int i = 1; i <= n; i++) {
            int r = read(), max = 0;
            for (int j = 1; j <= r; j++) if (set.add(read())) max = j;

            sb.append("Case ").append(i).append(": ").append(max).append("\n");
            set.clear();
        }

        bw.write(sb.toString());
        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;
    }

}