FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
Data-structure/check_balanced_parenthesis_using_stack.cpp at master · Bhanups123/Data-structure · GitHub
Bhanups123
/
Data-structure
Public
Notifications
You must be signed in to change notification settings
Fork
0
Star
0
Code
Issues
0
Pull requests
0
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Issues
Pull requests
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
Data-structure
/
check_balanced_parenthesis_using_stack.cpp
Copy path
More file actions
More file actions
Latest commit
History
History
History
38 lines (37 loc) · 634 Bytes
Breadcrumbs
Data-structure
/
check_balanced_parenthesis_using_stack.cpp
Copy path
File metadata and controls
38 lines (37 loc) · 634 Bytes
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
#
include
<
iostream
>
#
include
<
string
>
#
include
<
stack
>
using
namespace
std
;
bool
check_balanced_parenthesis
(string str){
stack<
char
> s;
for
(
char
&chr:str){
if
(chr==
'
(
'
||chr==
'
{
'
||chr==
'
[
'
){
s.
push
(chr);
}
else
if
(chr==
'
)
'
){
if
(!s.
empty
()&&s.
top
()==
'
(
'
)
s.
pop
();
else
return
false
;
}
else
if
(chr==
'
}
'
){
if
(!s.
empty
()&&s.
top
()==
'
{
'
)
s.
pop
();
else
return
false
;
}
else
if
(chr==
'
]
'
){
if
(!s.
empty
()&&s.
top
()==
'
[
'
)
s.
pop
();
else
return
false
;
}
}
return
s.
empty
()?
true
:
false
;
}
int
main
(){
string str;
getline
(cin, str);
cout<<
check_balanced_parenthesis
(str);
return
0
;
}
Back
|
FazBrowse Home
|
New Git URL