Commitdba2ab0

committed

refactor 1644

1 parent65d9ce8 commitdba2ab0Copy full SHA for dba2ab0

File tree

-2

lines changed

-2

lines changed

Lines changed: 5 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -48,6 +48,9 @@ private TreeNode dfs(TreeNode root, TreeNode p, TreeNode q) {`
`48`	`48`	`}`
`49`	`49`
`50`	`50`	`publicstaticclassSolution2 {`
	`51`	`+/**`
	`52`	`+ * This satisfies the follow-up question: Can you find the LCA traversing the tree, without checking nodes existence?`
	`53`	`+ */`
`51`	`54`	`intfound =0;`
`52`	`55`
`53`	`56`	`publicTreeNodelowestCommonAncestor(TreeNoderoot,TreeNodep,TreeNodeq) {`
`@@ -57,15 +60,15 @@ public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {`
`57`	`60`
`58`	`61`	`privateTreeNodelca(TreeNoderoot,TreeNodep,TreeNodeq) {`
`59`	`62`	`if (root ==null) {`
`60`		`-returnroot;`
	`63`	`+returnnull;`
`61`	`64`	`}`
`62`	`65`	`TreeNodeleft =lca(root.left,p,q);`
`63`	`66`	`TreeNoderight =lca(root.right,p,q);`
`64`	`67`	`if (root ==p \|\|root ==q) {`
`65`	`68`	`found++;`
`66`	`69`	`returnroot;`
`67`	`70`	`}`
`68`		`-returnleft==null ?right :right ==null ?left :root;`
	`71`	`+return(left!=null &&right !=null) ?root :left !=null ?left :right;`
`69`	`72`	`}`
`70`	`73`	`}`
`71`	`74`	`}`

Comments

(0)