FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
DataStructure-Java/Stack/stackparanthesis.java at master · joharbatta/DataStructure-Java · GitHub
joharbatta
/
DataStructure-Java
Public
Notifications
You must be signed in to change notification settings
Fork
15
Star
9
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
DataStructure-Java
/
Stack
/
stackparanthesis.java
Copy path
More file actions
More file actions
Latest commit
History
History
History
50 lines (45 loc) · 869 Bytes
Breadcrumbs
DataStructure-Java
/
Stack
/
stackparanthesis.java
Copy path
File metadata and controls
50 lines (45 loc) · 869 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
39
40
41
42
43
44
45
46
47
48
49
50
import
java
.
util
.*;
import
java
.
util
.
Stack
;
public
class
stackparanthesis
{
public
static
void
main
(
String
[]
args
)
{
Stack
<
Character
>
stack
=
new
Stack
<
Character
>();
Scanner
s1
=
new
Scanner
(
System
.
in
);
System
.
out
.
print
(
"Enter the String containing brackets : "
);
String
arr
=
s1
.
nextLine
();
if
(
arr
.
length
()%
2
!=
0
)
{
System
.
out
.
println
(
"String is Not Balanced"
);
}
else
{
for
(
int
i
=
0
;
i
<
arr
.
length
();
i
++)
{
char
ch
=
arr
.
charAt
(
i
);
if
(
ch
==
'{'
||
ch
==
'['
||
ch
==
'('
)
{
stack
.
push
(
ch
);
}
else
{
if
(!
stack
.
isEmpty
())
{
char
c
=
stack
.
peek
();
if
((
ch
==
'}'
&&
c
==
'{'
) || (
ch
==
']'
&&
c
==
'['
) ||(
ch
==
')'
&&
c
==
'('
))
{
stack
.
pop
();
}
}
}
}
if
(
stack
.
isEmpty
())
{
System
.
out
.
println
(
"String is Balanced"
);
}
else
{
System
.
out
.
println
(
"String is Not Balanced"
);
}
}
}
}
Back
|
FazBrowse Home
|
New Git URL