[백준-1269번/Java] 대칭 차집합

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

1269번: 대칭 차집합

 

* HashMap을 사용해 교집합을 구했다.

copy_A.entrySet().retainAll(B.entrySet());

import java.io.*;
import java.util.*;

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));
		StringTokenizer stk = new StringTokenizer(br.readLine(), " ");

		int N = Integer.parseInt(stk.nextToken());
		int M = Integer.parseInt(stk.nextToken());

		Map<String, Integer> A = new HashMap<String, Integer>();
		Map<String, Integer> B = new HashMap<String, Integer>();

		StringTokenizer a_token = new StringTokenizer(br.readLine(), " ");
		StringTokenizer b_token = new StringTokenizer(br.readLine(), " ");

		for (int i = 0; i < N; i++) {
			A.put(a_token.nextToken(), 1);
		}

		for (int i = 0; i < M; i++) {
			B.put(b_token.nextToken(), 1);
		}

		Map<String, Integer> copy_A = new HashMap<String, Integer>(A);
		
		copy_A.entrySet().retainAll(B.entrySet());

		System.out.println(N + M - copy_A.size() * 2);
	}

}