Commit d407887

committed

LeetCode 199

1 parent 4595cb4 commit d407887Copy full SHA for d407887

File tree

+59

-4

lines changed

+59

-4

lines changed

Lines changed: 20 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -38,12 +38,30 @@`
`38`	`38`	`<!-- 这里可写当前语言的特殊实现逻辑 -->`
`39`	`39`
`40`	`40`	```java
`41`		`-`
	`41`	`+class Solution {`
	`42`	`+ public List<Integer> rightSideView(TreeNode root) {`
	`43`	`+ List<Integer> ans = new ArrayList<>();`
	`44`	`+ robot(root, ans, 0);`
	`45`	`+ return ans;`
	`46`	`+ }`
	`47`	`+`
	`48`	`+ private void robot(TreeNode root, List<Integer> ans, int level) {`
	`49`	`+ if (root == null) {`
	`50`	`+ return;`
	`51`	`+ }`
	`52`	`+ if (ans.size() <= level) {`
	`53`	`+ ans.add(root.val);`
	`54`	`+ }`
	`55`	`+ ans.set(level, root.val);`
	`56`	`+ robot(root.left, ans, level + 1);`
	`57`	`+ robot(root.right, ans, level + 1);`
	`58`	`+ }`
	`59`	`+}`
`42`	`60`	```
`43`	`61`
`44`	`62`	`### ...`
`45`	`63`	```
`46`	`64`
`47`	`65`	```
`48`	`66`
`49`		`-<!-- tabs:end -->`
	`67`	`+<!-- tabs:end -->`

Lines changed: 20 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -48,12 +48,30 @@`
`48`	`48`	`### Java`
`49`	`49`
`50`	`50`	```java
`51`		`-`
	`51`	`+class Solution {`
	`52`	`+ public List<Integer> rightSideView(TreeNode root) {`
	`53`	`+ List<Integer> ans = new ArrayList<>();`
	`54`	`+ robot(root, ans, 0);`
	`55`	`+ return ans;`
	`56`	`+ }`
	`57`	`+`
	`58`	`+ private void robot(TreeNode root, List<Integer> ans, int level) {`
	`59`	`+ if (root == null) {`
	`60`	`+ return;`
	`61`	`+ }`
	`62`	`+ if (ans.size() <= level) {`
	`63`	`+ ans.add(root.val);`
	`64`	`+ }`
	`65`	`+ ans.set(level, root.val);`
	`66`	`+ robot(root.left, ans, level + 1);`
	`67`	`+ robot(root.right, ans, level + 1);`
	`68`	`+ }`
	`69`	`+}`
`52`	`70`	```
`53`	`71`
`54`	`72`	`### ...`
`55`	`73`	```
`56`	`74`
`57`	`75`	```
`58`	`76`
`59`		`-<!-- tabs:end -->`
	`77`	`+<!-- tabs:end -->`

Lines changed: 19 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,19 @@`
	`1`	`+class Solution {`
	`2`	`+ public List<Integer> rightSideView(TreeNode root) {`
	`3`	`+ List<Integer> ans = new ArrayList<>();`
	`4`	`+ robot(root, ans, 0);`
	`5`	`+ return ans;`
	`6`	`+ }`
	`7`	`+`
	`8`	`+ private void robot(TreeNode root, List<Integer> ans, int level) {`
	`9`	`+ if (root == null) {`
	`10`	`+ return;`
	`11`	`+ }`
	`12`	`+ if (ans.size() <= level) {`
	`13`	`+ ans.add(root.val);`
	`14`	`+ }`
	`15`	`+ ans.set(level, root.val);`
	`16`	`+ robot(root.left, ans, level + 1);`
	`17`	`+ robot(root.right, ans, level + 1);`
	`18`	`+ }`
	`19`	`+}`

Comments

(0)