-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathproblem4.cpp
More file actions
84 lines (84 loc) · 1.82 KB
/
problem4.cpp
File metadata and controls
84 lines (84 loc) · 1.82 KB
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
#include <iostream>
#include <iomanip>
#include <cmath>
#include <numeric>
//#include<bits/stdc++.h>
#include <string>
#include <cassert>
using namespace std;
#define endl '\n'
//#define haha cin.tie(0), cout.tie(0), cin.sync_with_stdio(0), cout.sync_with_stdio(0);
#define ll long long
class stack{
private:
int size{};
int top{};
char *array{};
public :
stack(int size):
size(size),top(-1){
array=new char [size];
}
int isfull(){
return top==size-1;
}
bool isempty(){
return top==-1;
}
void display(){
for(int i=top;i>=0;i--)cout<<array[i]<<" ";
cout<<endl;
}
void push(char ele){
if(top==size-1)return;
array[++top]=ele;
}
char pop(){
if(top==-1);
else return array[top--];
}
char peek(){
if(top==-1);
else return array[top];
}
};
bool isValid(string str){
stack st(str.length());
stack current(str.length());
for(int i=0;i<str.length();i++){
if(str[i]==']'){
if(!current.isempty()){
if('['==current.peek()){
current.pop();
//reversed.pop();
continue;}
return false;
}
return false;
}
else if(str[i]=='}'){
if(!current.isempty()){
if('{'==current.peek()){
current.pop();
continue;}
return false;
}
return false;
}
else if(str[i]==')'){
if(!current.isempty()){
if('('==current.peek()){
current.pop();
continue;}
return false;
}
return false;
}
else current.push(str[i]);
}
if(current.isempty())return true;
else return false;
};
int main(){
cout<<isValid("())");
}