FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
LeetCode/BinaryTreeRightSideView.java at master · Orio77/LeetCode · GitHub
Orio77
/
LeetCode
Public
Notifications
You must be signed in to change notification settings
Fork
0
Star
0
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
LeetCode
/
BinaryTreeRightSideView.java
Copy path
More file actions
More file actions
Latest commit
History
History
History
93 lines (82 loc) · 2.61 KB
Breadcrumbs
LeetCode
/
BinaryTreeRightSideView.java
Copy path
File metadata and controls
93 lines (82 loc) · 2.61 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
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
import
java
.
util
.
ArrayList
;
import
java
.
util
.
List
;
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class
MySolution
{
private
int
answerLevel
;
public
List
<
Integer
>
rightSideView
(
TreeNode
root
) {
if
(
root
==
null
) {
return
new
ArrayList
<>();
}
List
<
TreeNode
>
answerNodes
=
new
ArrayList
<>();
List
<
Integer
>
answer
=
new
ArrayList
<>();
TreeNode
dummy
=
root
;
while
(
dummy
!=
null
) {
answerNodes
.
add
(
dummy
);
answer
.
add
(
dummy
.
val
);
dummy
=
dummy
.
right
;
answerLevel
++;
}
for
(
int
i
=
1
;
i
<
answerNodes
.
size
();
i
++) {
answer
=
viewHelper
(
answerNodes
.
get
(
i
),
i
,
answerLevel
,
answer
);
}
if
(
root
.
left
!=
null
) {
return
viewHelper
(
root
.
left
,
2
,
answerLevel
,
answer
);
}
return
answer
;
}
private
List
<
Integer
>
viewHelper
(
TreeNode
node
,
int
currentLevel
,
int
answerLevel
,
List
<
Integer
>
answer
) {
if
(
currentLevel
-
1
==
answerLevel
&& !
answer
.
contains
(
node
.
val
)) {
answer
.
add
(
node
.
val
);
}
if
(
node
.
right
!=
null
) {
if
(
currentLevel
>
answerLevel
) {
answer
.
add
(
node
.
right
.
val
);
answer
=
viewHelper
(
node
.
right
, ++
currentLevel
, ++
answerLevel
,
answer
);
}
else
{
viewHelper
(
node
.
right
, ++
currentLevel
,
answerLevel
,
answer
);
}
}
if
(
node
.
left
!=
null
) {
if
(
currentLevel
>
answerLevel
) {
answer
.
add
(
node
.
left
.
val
);
answer
=
viewHelper
(
node
.
left
, ++
currentLevel
, ++
answerLevel
,
answer
);
}
else
{
viewHelper
(
node
.
left
, ++
currentLevel
,
answerLevel
,
answer
);
}
}
return
answer
;
}
}
class
Solution
{
public
List
<
Integer
>
rightSideView
(
TreeNode
root
) {
List
<
Integer
>
result
=
new
ArrayList
<>();
rightView
(
root
,
result
,
0
);
return
result
;
}
private
void
rightView
(
TreeNode
curr
,
List
<
Integer
>
result
,
int
currDepth
) {
if
(
curr
==
null
) {
return
;
}
if
(
currDepth
==
result
.
size
()) {
result
.
add
(
curr
.
val
);
}
rightView
(
curr
.
right
,
result
,
currDepth
);
rightView
(
curr
.
left
,
result
,
currDepth
);
}
}
Back
|
FazBrowse Home
|
New Git URL