FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
algorithm/Week_01/id_119/LeetCode_20_119.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_119
/
LeetCode_20_119.cpp
Copy path
More file actions
More file actions
Latest commit
History
History
History
39 lines (34 loc) · 1010 Bytes
Breadcrumbs
algorithm
/
Week_01
/
id_119
/
LeetCode_20_119.cpp
Copy path
File metadata and controls
39 lines (34 loc) · 1010 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
class
Solution
{
public:
bool
isValid
(string s) {
if
(s.
size
() ==
0
) {
return
true
;
}
std::unordered_map<
char
,
char
> hash = {
{
'
(
'
,
'
)
'
},
{
'
[
'
,
'
]
'
},
{
'
{
'
,
'
}
'
},
};
std::unordered_map<
char
,
char
>::iterator iter;
std::stack<
char
> test;
for
(string::size_type i=
0
;i<s.
size
();i++) {
if
(!test.
empty
()) {
iter = hash.
find
(test.
top
());
if
(s[i] == iter->
second
) {
test.
pop
();
}
else
if
(hash.
find
(s[i]) != hash.
end
()) {
test.
push
(s[i]);
}
else
{
return
false
;
}
}
else
{
if
(hash.
find
(s[i]) != hash.
end
()) {
test.
push
(s[i]);
}
else
{
return
false
;
}
}
}
return
test.
empty
();
}
};
Back
|
FazBrowse Home
|
New Git URL