practice_dsa/problems/cpp/stack/BalancedParanthesis/bp.cpp at main · Parihar07/practice_dsa · 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
#include<iostream>
#include<stack>
#include<unordered_map>

using namespace std;

int solve(string A);
int solve2(string A);

int solve2(string A) {
  unordered_map<char, char> pmap;
  pmap['['] = ']';
  pmap['{'] = '}';
  pmap['('] = ')';
  pmap['"'] = '"';
  pmap[']'] = '[';
  pmap['}'] = '{';
  pmap[')'] = '(';
  pmap['"'] = '"';

  stack<char> stk;
  int l = A.length() - 1;
  while (l >= 0)
  {
	if (stk.empty())
	{
	  stk.push(A[l]);
	}
	else {
	  if (pmap.find(stk.top()) != pmap.end())
	  {
		stk.pop();
	  }
	  else {
		stk.push(A[l]);
	  }
	}
	l--;
  }

  return stk.empty() ? 1 : 0;
}

int solve(string A)
{
  stack<char> stk;
  int l = A.length() - 1;
  while (l >= 0)
  {
	if (stk.empty())
	{
	  stk.push(A[l]);
	}
	else {
	  if ((stk.top() == '}' && A[l] == '{') ||
		(stk.top() == ')' && A[l] == '(') ||
		(stk.top() == ']' && A[l] == '['))
	  {
		stk.pop();
	  }
	  else {
		stk.push(A[l]);
	  }
	}
	l--;
  }

  return stk.empty() ? 1 : 0;
}
int main()
{
  string A = "{([])}";
  string B = "{([])";
  string C = "{[]}[]";
  string D = "(((((((((((";

  cout << " Valid : " << solve(A) << endl;
  cout << " Valid : " << solve(B) << endl;
  cout << " Valid : " << solve(C) << endl;
  cout << " Valid : " << solve(D) << endl;

  return 0;
}