Commit701f071

committed

[LEET-000] organize comments

1 parente0aa328 commit701f071Copy full SHA for 701f071

File tree

+12

-10

lines changed

leetcode-algorithms/src/main/java/com/stevesun/solutions
- BinaryTreeLongestConsecutiveSequence.java

+12

-10

lines changed

Lines changed: 12 additions & 10 deletions

Original file line number	Diff line number	Diff line change
`@@ -5,24 +5,26 @@`
`5`	`5`	`/**`
`6`	`6`	`* Given a binary tree, find the length of the longest consecutive sequence path.`
`7`	`7`
`8`		`- The path refers to any sequence of nodes from some starting node to any node in the tree along the parent-child connections. The longest consecutive path need to be from parent to child (cannot be the reverse).`
	`8`	`+ The path refers to any sequence of nodes from some starting node to any node in the tree along the parent-child connections.`
	`9`	`+ The longest consecutive path need to be from parent to child (cannot be the reverse).`
`9`	`10`
`10`	`11`	`For example,`
`11`		`- 1`
	`12`	`+1`
`12`	`13`	`\`
`13`	`14`	`3`
`14`	`15`	`/ \`
`15`	`16`	`2 4`
`16`		`- \`
`17`		`- 5`
	`17`	`+\`
	`18`	`+5`
`18`	`19`	`Longest consecutive sequence path is 3-4-5, so return 3.`
`19`		`- 2`
`20`		`- \`
`21`		`- 3`
`22`		`- /`
`23`		`- 2`
	`20`	`+`
	`21`	`+ 2`
	`22`	`+ \`
	`23`	`+ 3`
	`24`	`+ /`
	`25`	`+ 2`
`24`	`26`	`/`
`25`		`-1`
	`27`	`+1`
`26`	`28`	`Longest consecutive sequence path is 2-3,not3-2-1, so return 2.`
`27`	`29`	`*/`
`28`	`30`	`publicclassBinaryTreeLongestConsecutiveSequence {`

Comments

(0)