[백준] 34115 먼 카드 - Brute Force / Java

• 문제 링크

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

 

• 풀이 코드

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() * 2, max = 0;
        for (int i = 0; i < n; i++) {
            int k = read();
            if (!map.containsKey(k)) map.put(k, i);
            else max = Math.max(max, i - map.get(k) - 1);
        }

        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;
    }

}