[Algorithm] SWEA 1218 괄호짝짓기

https://swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV14eWb6AAkCFAYD 

SW Expert Academy

 

---

 

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

public class Solution {
	
	public static boolean mapping (char c, char top) {
    
		if ((c == ')' && top == '(') || (c == ']' && top == '[') || (c == '}' && top == '{') || (c == '>' && top == '<'))
			return true;
		else
			return false;
	}


	public static void main(String[] args) throws IOException {
    
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		
		int T = Integer.parseInt(br.readLine());
		for (int t = 1; t <= T; t++) {
			int len = Integer.parseInt(br.readLine());
			String str = br.readLine();
			int result = 1; // 1:유효, 2:유효하지 않음
			
			Stack<Character> stack = new Stack<>();
			for (int i= 0; i < len; i++) {
				char c = str.charAt(i);

				switch(c) {
					case '(' : 
					case '[' :
					case '{' : 
					case '<' :
						stack.push(c);
						break;
					default :
						if (!stack.empty() && mapping(c, stack.peek()))
							stack.pop();
						else
							result = 0;
				}
				
				if (result == 0)
					break;
			}
            
			System.out.println("#" + t + " " + result);
		}
	}
}