Commit ceed453

authored

Merge pull request youngyangyang04#1130 from xiaofei-2020/tree29

添加(0235.二叉搜索树的最近公共祖先.md):增加typescript版本

2 parents f2f740f + 246bbe9 commit ceed453Copy full SHA for ceed453

File tree

+33

-0

lines changed

+33

-0

lines changed

Lines changed: 33 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -350,6 +350,39 @@ var lowestCommonAncestor = function(root, p, q) {`
`350`	`350`	`};`
`351`	`351`	```
`352`	`352`
	`353`	`+## TypeScript`
	`354`	`+`
	`355`	`+> 递归法:`
	`356`	`+`
	`357`	+```typescript
	`358`	`+function lowestCommonAncestor(root: TreeNode \| null, p: TreeNode \| null, q: TreeNode \| null): TreeNode \| null {`
	`359`	`+ if (root.val > p.val && root.val > q.val)`
	`360`	`+ return lowestCommonAncestor(root.left, p, q);`
	`361`	`+ if (root.val < p.val && root.val < q.val)`
	`362`	`+ return lowestCommonAncestor(root.right, p, q);`
	`363`	`+ return root;`
	`364`	`+};`
	`365`	+```
	`366`	`+`
	`367`	`+> 迭代法:`
	`368`	`+`
	`369`	+```typescript
	`370`	`+function lowestCommonAncestor(root: TreeNode \| null, p: TreeNode \| null, q: TreeNode \| null): TreeNode \| null {`
	`371`	`+ while (root !== null) {`
	`372`	`+ if (root.val > p.val && root.val > q.val) {`
	`373`	`+ root = root.left;`
	`374`	`+ } else if (root.val < p.val && root.val < q.val) {`
	`375`	`+ root = root.right;`
	`376`	`+ } else {`
	`377`	`+ return root;`
	`378`	`+ };`
	`379`	`+ };`
	`380`	`+ return null;`
	`381`	`+};`
	`382`	+```
	`383`	`+`
	`384`	`+`
	`385`	`+`
`353`	`386`
`354`	`387`	`-----------------------`
`355`	`388`	`<div align="center"><img src=https://code-thinking.cdn.bcebos.com/pics/01二维码一.jpg width=500> </img></div>`

Comments

(0)