DataStructAndAlgorithmClass/2022-04-20.cpp at master · hun1001/DataStructAndAlgorithmClass · GitHub

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
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
#include <iostream>
#include <stack>
using namespace std;

void P1();

int main()
{
	stack<char> s;
	string me;

	int parenthesesCnt(0);
	int curlyBrackets(0);
	int squareBrackets(0);

	cin >> me;

	for(string::iterator it = me.begin(); it != me.end(); it++)
	{
		switch (*it)
		{
		case '(':
			s.push('(');
			parenthesesCnt++;
			break;
		case '{':
			s.push('{');
			curlyBrackets++;
			break;
		case '[':
			s.push('[');
			squareBrackets++;
			break;
		case ')':
			if(s.top() == '(')
			{
				s.pop();
				parenthesesCnt--;
			}
			else
			{
				cout << "괄호 검사 실패" << endl;
				return 0;
			}
			break;
		case '}':
			if(s.top() == '{')
			{
				s.pop();
				curlyBrackets--;
			}
			else
			{
				cout << "괄호 검사 실패" << endl;
				return 0;
			}
			break;
		case ']':
			if(s.top() == '[')
			{
				s.pop();
				squareBrackets--;
			}
			else
			{
				cout << "괄호 검사 실패" << endl;
				return 0;
			}
			break;
		default:
			break;
		}
	}

	cout << "괄호 검사 성공" << endl;
	return 0;
}

void P1()
{
	string bracket;
	stack<char> s;

	int cnt = 1;

	cout << "수식\t\t: ";
	cin >> bracket;

	cout << "괄호 번호\t: ";

	for (int i = 0; i < bracket.length(); i++)
	{
		if (bracket[i] == '(')
		{
			cout << cnt;
			s.push(cnt++);
		}
		else if (bracket[i] == ')')
		{
			cout << (int)s.top();
			s.pop();
		}
	}
}