FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
algorithm/Week_01/id_131/LeetCode_20_131.cpp at master · feixiangcode/algorithm · GitHub
feixiangcode
/
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_131
/
LeetCode_20_131.cpp
Copy path
More file actions
More file actions
Latest commit
History
History
History
65 lines (62 loc) · 1.38 KB
Breadcrumbs
algorithm
/
Week_01
/
id_131
/
LeetCode_20_131.cpp
Copy path
File metadata and controls
65 lines (62 loc) · 1.38 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
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
class
Solution
{
public:
bool
isMatchStack
(stack<
char
> &strStack,
char
c)
{
if
(strStack.
empty
())
return
false
;
switch
(c)
{
case
'
)
'
:
{
if
(
'
(
'
== strStack.
top
())
{
strStack.
pop
();
return
true
;
}
break
;
}
case
'
}
'
:
{
if
(
'
{
'
== strStack.
top
())
{
strStack.
pop
();
return
true
;
}
break
;
}
case
'
]
'
:
{
if
(
'
[
'
== strStack.
top
())
{
strStack.
pop
();
return
true
;
}
break
;
}
}
return
false
;
}
bool
isValid
(string s)
{
if
(s.
empty
())
return
true
;
stack<
char
> strStack;
for
(
int
i =
0
; i < s.
size
(); ++i)
{
if
( (s[i] ==
'
(
'
) || (s[i] ==
'
[
'
) || (s[i] ==
'
{
'
) )
{
strStack.
push
(s[i]);
}
else
if
( !
isMatchStack
(strStack,s[i]) )
{
return
false
;
}
}
if
(strStack.
empty
())
{
return
true
;
}
else
{
return
false
;
}
}
};
Back
|
FazBrowse Home
|
New Git URL