Commit826c876

committed

refactor 543

1 parent4c2221c commit826c876Copy full SHA for 826c876

File tree

-0

lines changed

-0

lines changed

Lines changed: 4 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -6,6 +6,10 @@ public class _543 {`
`6`	`6`
`7`	`7`	`publicstaticclassSolution1 {`
`8`	`8`	`/**`
	`9`	`+ * A great observation of this problem is that the longest path must exist between two leaf nodes,`
	`10`	`+ * since it's easy to prove its opposite is not the longest by simply adding one to reach its leaf node.`
	`11`	`+ *`
	`12`	`+ * <p>`
`9`	`13`	`* This is a very great problem for practicing recursion:`
`10`	`14`	`* 1. What dfs() returns is the max height it should pick from either its left or right subtree, that's`
`11`	`15`	`* what the int return type stands for;`

Comments

(0)