[SWEA][JAVA]D3 : 적고 지우기

https://swexpertacademy.com/main/code/problem/problemDetail.do?problemLevel=3&contestProbId=AW37UDPKCgQDFATy&categoryId=AW37UDPKCgQDFATy&categoryType=CODE&problemTitle=&orderBy=PASS_RATE&selectCodeLang=JAVA&select-1=3&pageSize=10&pageIndex=4 

SW Expert Academy

 

---

입력된 숫자중에서 홀수개로 입력된것의 갯수..

Stack을 이용해서 없으면 push, 있으면 pop

 

import java.util.Scanner;
import java.util.Stack;

class Solution
{
    public static void main(String args[]) throws Exception
    {
        Scanner kb = new Scanner(System.in);
        int t = kb.nextInt();
        for (int test_case = 1; test_case <= t; test_case++) {
            String s=kb.next();
            String[] arr=s.split("");

            Stack<String> stack=new Stack<>();
            for(int i=0; i<arr.length; i++){
                if(!stack.contains(arr[i]))
                    stack.push(arr[i]);
                else
                    stack.remove(arr[i]);
            }
            System.out.println("#"+test_case+" "+stack.size());
        }
    }
}