Notice
Recent Posts
Recent Comments
Link
«   2024/11   »
1 2
3 4 5 6 7 8 9
10 11 12 13 14 15 16
17 18 19 20 21 22 23
24 25 26 27 28 29 30
Tags
more
Archives
Today
Total
관리 메뉴

코드와이

[SW Expert Academy] 1218. [S/W 문제해결 기본] 4일차 - 괄호 짝짓기 본문

SW_Expert

[SW Expert Academy] 1218. [S/W 문제해결 기본] 4일차 - 괄호 짝짓기

코드와이 2021. 3. 1. 15:15

 

문제링크

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

 

SW Expert Academy

SW 프로그래밍 역량 강화에 도움이 되는 다양한 학습 컨텐츠를 확인하세요!

swexpertacademy.com

 

package D4;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Stack;
import java.util.StringTokenizer;

public class 괄호_짝짖기 {
	
	static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
	static StringTokenizer st;
	
	public static void main(String[] args) throws NumberFormatException, IOException {
		
		StringBuilder sb = new StringBuilder();
		
		for(int tc = 1 ; tc <= 10 ; tc++) {
			
			sb.append("#" + tc + " ");
			
			Stack<String> a = new Stack<String>();
			Stack<String> b = new Stack<String>();
			Stack<String> c = new Stack<String>();
			Stack<String> d = new Stack<String>();
			
			Integer.parseInt(br.readLine());
			String[] input = br.readLine().split("");
			boolean flag = true;

			for( String s : input) {

				if(s.equals("(")) a.add(s);
				else if(s.equals("[")) b.add(s);
				else if(s.equals("{")) c.add(s);
				else if(s.equals("<")) d.add(s);
				else if(s.equals(")")) {
					try{
						a.pop();
					} catch(Exception e) {
						flag = false;
						break;
					}
				}
				else if(s.equals("]")) {
					try{
						b.pop();
					} catch(Exception e) {
						flag = false;
						break;
					}
				}
				else if(s.equals("}")) {
					try{
						c.pop();
					} catch(Exception e) {
						flag = false;
						break;
					}
				}
				else if(s.equals(">")) {
					try{
						d.pop();
					} catch(Exception e) {
						flag = false;
						break;
					}
				}
			}
			int ans = flag == true && a.size() + b.size() + c.size() + d.size() == 0 ? 1 : 0;
			
			sb.append(ans).append("\n");
		}
		sb.setLength(sb.length()-1);
		System.out.println(sb);
	}
}