HR자바 Java BitSet

개요

HR자바 Java BitSet

• https://www.hackerrank.com/challenges/java-bitset/problem

해커랭크 Java

#	문제	비고
HR자바 Data Structures e
28	HR자바 Java 1D Array
29	HR자바 Java 2D Array
30	HR자바 Java Subarray
31	HR자바 Java Arraylist
32	HR자바 Java 1D Array (Part 2)
33	HR자바 Java List
34	HR자바 Java Map
35	HR자바 Java Stack
36	HR자바 Java Hashset
37	HR자바 Java Generics
38	HR자바 Java Comparator
39	HR자바 Java Sort
40	HR자바 Java Dequeue
41	HR자바 Java BitSet
42	HR자바 Java Priority Queue

---

Java

Copy

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

public class Solution {

    public static void main(String[] args) {
        /* Enter your code here. Read input from STDIN. Print output to STDOUT. Your class should be named Solution. */
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        BitSet[] B = new BitSet[2];
        B[0] = new BitSet(N);
        B[1] = new BitSet(N);
        
        int M = sc.nextInt();
        for(int i=0; i<M; i++) {
            String operation = sc.next();
            int x = sc.nextInt();
            int y = sc.nextInt();
            switch( operation ) {
                case "AND":  B[x-1].and(B[y-1]); break;
                case "OR":   B[x-1].or(B[y-1]); break;
                case "XOR":  B[x-1].xor(B[y-1]); break;
                case "FLIP": B[x-1].flip(y); break;
                case "SET":  B[x-1].set(y); break;
            }
            System.out.println( B[0].cardinality()+" "+B[1].cardinality() );
        }
    }
}