Notice
Recent Posts
Recent Comments
Link
«   2025/02   »
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
Archives
Today
Total
관리 메뉴

최's 먹공로그

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

APS

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

ChoiSH313 2019. 2. 3. 16:40

https://www.swexpertacademy.com/main/code/problem/problemDetail.do

 

 

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
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
import java.util.Scanner;
import java.util.Stack;
 
public class Solution_1218_SW문제해결기본_괄호짝짓기_최성호 {
 
    public static void main(String[] args) {
 
        Scanner sc = new Scanner(System.in);
        char[] arr;
        for(int tc = 1; tc <= 10; tc++) {
            
            Stack<Character> stack1 = new Stack<>();
            Stack<Character> stack2 = new Stack<>();
            Stack<Character> stack3 = new Stack<>();
            Stack<Character> stack4 = new Stack<>();
            
            int size = sc.nextInt();
            String a = sc.next();
            arr = new char[size];
            for(int i = 0; i < size; i++) {
                arr[i] = a.charAt(i);
                if(arr[i] == '(') {
                    stack1.push(arr[i]);
                }
                if(arr[i] == '[') {
                    stack2.push(arr[i]);
                }
                if(arr[i] == '{') {
                    stack3.push(arr[i]);
                }
                if(arr[i] == '<') {
                    stack4.push(arr[i]);
                }
                
                if(arr[i] == ')') {
                    if(!stack1.isEmpty()) {
                        stack1.pop();
                    }
                    else
                        break;
                }
                if(arr[i] == ']') {
                    if(!stack2.isEmpty()) {
                        stack2.pop();
                    }
                    else
                        break;
                }
                if(arr[i] == '}') {
                    if(!stack3.isEmpty()) {
                        stack3.pop();
                    }
                    else
                        break;
                }
                if(arr[i] == '>') {
                    if(!stack4.isEmpty()) {
                        stack4.pop();
                    }
                    else
                        break;
                }
            }
            if(stack1.size() == 0 && stack2.size() == 0 && stack3.size() == 0 && stack4.size() == 0) {
                System.out.println("#" + tc + " " +  1);
            }
            else{
                System.out.println("#" + tc + " " + 0);
            }
            
            
            
        } // end of tc
    } // end of main
 
}
 
cs

 

stack을 한개만 써야된다면

모든 종류의 여는 괄호가 들어올 때 stack에 push해주고 닫는 괄호가 들어올 때 pop하기 전에 peek로 비교하고 쌍에 맞는 여는 괄호가 있을 경우 그 위치까지 pop해주면서 배열에 저장하고 배열에 있는 괄호를 다시 push