FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
algorithm/Week_02/id_139/LeetCode_671_139.java 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_02
/
id_139
/
LeetCode_671_139.java
Copy path
More file actions
More file actions
Latest commit
History
History
History
25 lines (23 loc) · 710 Bytes
Breadcrumbs
algorithm
/
Week_02
/
id_139
/
LeetCode_671_139.java
Copy path
File metadata and controls
25 lines (23 loc) · 710 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
class
Solution
{
public
int
findSecondMinimumValue
(
TreeNode
root
) {
if
(
root
==
null
||
root
.
left
==
null
||
root
.
right
==
null
) {
return
-
1
;
}
long
min
=
Long
.
MAX_VALUE
;
Stack
<
TreeNode
>
stack
=
new
Stack
<>();
stack
.
push
(
root
);
while
(!
stack
.
empty
()) {
TreeNode
node
=
stack
.
pop
();
if
((
long
)
node
.
val
<
min
&&
node
.
val
>
root
.
val
) {
min
=(
long
)
node
.
val
;
}
if
(
node
.
right
!=
null
) {
stack
.
push
(
node
.
right
);
}
if
(
node
.
left
!=
null
) {
stack
.
push
(
node
.
left
);
}
}
return
min
==
Long
.
MAX_VALUE
?-
1
:(
int
)
min
;
}
}
Back
|
FazBrowse Home
|
New Git URL