[자바] 백준 11723번: 집합

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

11723번: 집합

 

자바 HashSet을 그대로 사용해서 풀었다.

출력이 많기 때문에 bufferedwriter를 사용해야 시간초과가 나지 않는다.

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.HashSet;
import java.util.StringTokenizer;

public class P11723 {

	public static void main(String[] args) throws NumberFormatException, IOException {

		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
		int m = Integer.parseInt(br.readLine());
		HashSet<String> set = new HashSet<>();

		for (int i = 0; i < m; i++) {
			StringTokenizer st = new StringTokenizer(br.readLine());
			String commend = st.nextToken();
			if (commend.equals("add")) {
				set.add(st.nextToken());
			} else if (commend.equals("remove")) {
				set.remove(st.nextToken());
			} else if (commend.equals("check")) {
				if (set.contains(st.nextToken())) {
					bw.append(1 + "\n");
				} else {
					bw.append(0 + "\n");

				}
			} else if (commend.equals("toggle")) {
				String x = st.nextToken();
				if (set.contains(x)) {
					set.remove(x);
				} else {
					set.add(x);
				}
			} else if (commend.equals("all")) {
				set.clear();
				for (int j = 1; j <= 20; j++) {
					set.add(String.valueOf(j));
				}
			} else if (commend.equals("empty")) {
				set.clear();
			}
		}
		bw.flush();
	}

}