[백준(Baekjoon)][자바(java)] 1269 : 대칭 차집합 / 집합과 맵

 

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

1269번: 대칭 차집합

 

문제 풀이

 

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.HashSet;
import java.util.Set;
import java.util.StringTokenizer;

public class Main {

	public static void main(String[] args) throws Exception {

		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

		StringTokenizer st = new StringTokenizer(br.readLine());
		int n = Integer.parseInt(st.nextToken()),
			m = Integer.parseInt(st.nextToken()), i;

		Set<Integer> set = new HashSet<>();
		st = new StringTokenizer(br.readLine());
		for (i = 0; i < n; ++i)
			set.add(Integer.parseInt(st.nextToken()));

		int cnt = 0;
		st = new StringTokenizer(br.readLine());
		for (i = 0; i < m; ++i) 
			if (set.contains(Integer.parseInt(st.nextToken())))
				cnt++;
		
		br.close();

		System.out.println((n - cnt) + (m - cnt));
	}
}