FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
algorithm/Week_01/id_108/LeetCode_20_108.java at master · isnotnull/algorithm · GitHub
isnotnull
/
algorithm
Public
forked from
algorithm001/algorithm
Notifications
You must be signed in to change notification settings
Fork
0
Star
0
Code
Pull requests
0
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Pull requests
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
algorithm
/
Week_01
/
id_108
/
LeetCode_20_108.java
Copy path
More file actions
More file actions
Latest commit
History
History
History
49 lines (46 loc) · 1.16 KB
Breadcrumbs
algorithm
/
Week_01
/
id_108
/
LeetCode_20_108.java
Copy path
File metadata and controls
49 lines (46 loc) · 1.16 KB
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
import
org
.
junit
.
Test
;
import
java
.
util
.
Stack
;
/**
* @author zhangruihao.zhang
* @version v1.0.0
* @since 2019/04/29
*/
public
class
LeetCode_20_108
{
public
static
void
main
(
String
[]
args
) {
String
str
=
"()[]{}"
;
System
.
out
.
println
(
isValid
(
str
));
}
public
static
boolean
isValid
(
String
s
) {
Stack
stack
=
new
Stack
();
for
(
int
i
=
0
;
i
<
s
.
length
();
i
++){
char
c
=
s
.
charAt
(
i
);
if
(
stack
.
peek
().
equals
(
anotherChar
(
c
))){
stack
.
pop
();
}
else
{
stack
.
push
(
c
);
}
}
return
stack
.
isEmpty
();
}
private
static
char
anotherChar
(
char
c
){
if
(
c
==
'('
){
return
')'
;
}
if
(
c
==
')'
){
return
'('
;
}
if
(
c
==
'{'
){
return
'}'
;
}
if
(
c
==
'}'
){
return
'{'
;
}
if
(
c
==
'['
){
return
']'
;
}
if
(
c
==
']'
){
return
'['
;
}
return
'0'
;
}
}
Back
|
FazBrowse Home
|
New Git URL