Commit 8d93b1e

authored

Merge pull request #334 from X-shuffle/master

添加 0222.完全二叉树的节点个数 go版本

2 parents 0a2a5b1 + 39f852e commit 8d93b1eCopy full SHA for 8d93b1e

File tree

+29

-0

lines changed

+29

-0

lines changed

Lines changed: 29 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -308,6 +308,35 @@ class Solution:`
`308`	`308`
`309`	`309`	`Go:`
`310`	`310`
	`311`	`+递归版本`
	`312`	`+`
	`313`	+```go
	`314`	`+/**`
	`315`	`+ * Definition for a binary tree node.`
	`316`	`+ * type TreeNode struct {`
	`317`	`+ * Val int`
	`318`	`+ * Left *TreeNode`
	`319`	`+ * Right *TreeNode`
	`320`	`+ * }`
	`321`	`+ */`
	`322`	`+//本题直接就是求有多少个节点,无脑存进数组算长度就行了。`
	`323`	`+func countNodes(root *TreeNode) int {`
	`324`	`+ if root == nil {`
	`325`	`+ return 0`
	`326`	`+ }`
	`327`	`+ res := 1`
	`328`	`+ if root.Right != nil {`
	`329`	`+ res += countNodes(root.Right)`
	`330`	`+ }`
	`331`	`+ if root.Left != nil {`
	`332`	`+ res += countNodes(root.Left)`
	`333`	`+ }`
	`334`	`+ return res`
	`335`	`+}`
	`336`	+```
	`337`	`+`
	`338`	`+`
	`339`	`+`
`311`	`340`	`JavaScript:`
`312`	`341`
`313`	`342`	`递归版本`

Comments

(0)