Commit 8fe89d5

author

hufeng

committed

添加binarytree例题

1 parent 244bc97 commit 8fe89d5Copy full SHA for 8fe89d5

File tree

+26

-0

lines changed

+26

-0

lines changed

Lines changed: 21 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -241,3 +241,24 @@ func swap(nums []int, i, j int) {`
`241`	`241`	`nums[i] = nums[j]`
`242`	`242`	`nums[j] = t`
`243`	`243`	`}`
	`244`	`+`
	`245`	`+/*`
	`246`	`+常见题目示例`
	`247`	`+*/`
	`248`	`+`
	`249`	`+// 给定一个二叉树,找出去最大深度`
	`250`	`+func maxDepth(root *TreeNode) int {`
	`251`	`+ // 返回条件处理`
	`252`	`+ if root == nil {`
	`253`	`+ return 0`
	`254`	`+ }`
	`255`	`+ // divide:分左右子树分别计算`
	`256`	`+ left := maxDepth(root.Left)`
	`257`	`+ right := maxDepth(root.Right)`
	`258`	`+`
	`259`	`+ // conquer:合并左右子树结果`
	`260`	`+ if left > right {`
	`261`	`+ return left + 1`
	`262`	`+ }`
	`263`	`+ return right + 1`
	`264`	`+}`

Lines changed: 5 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -69,3 +69,8 @@ func TestQuickSort(t *testing.T) {`
`69`	`69`	`result := QuickSort(nums)`
`70`	`70`	`fmt.Println(result)`
`71`	`71`	`}`
	`72`	`+`
	`73`	`+func TestMaxDepth(t *testing.T) {`
	`74`	`+ result := maxDepth(treeNode)`
	`75`	`+ fmt.Println(result)`
	`76`	`+}`

Comments

(0)