deno.land / x / masx200_leetcode_test@10.6.5 / count-complete-tree-nodes / index.go

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
package index
import "math"
func countNodes(root *TreeNode) int { return countNodesDepth(root, -1, -1)}
func countNodesDepth(root *TreeNode, leftDepth int, rightDepth int) int { if root == nil { return 0 }
var left = 0
var right = 0
var curNode = root
if leftDepth > 0 {
left = leftDepth } else {
for curNode != nil {
left++ curNode = curNode.Left }
} curNode = root
if rightDepth > 0 {
right = rightDepth } else {
for curNode != nil {
right++ curNode = curNode.Right }
}
if left == right {
return int(math.Pow(2, float64(left))) - 1 }
return (1 + countNodesDepth(root.Left, left-1, -1) + countNodesDepth(root.Right, -1, right-1))
}
masx200_leetcode_test
leetcode题解和一些测试工具
DocumentationDocumentation
GitHub Repositorymasx200/leetcode-test
GitHub Stars
4

Version Info

Tagged at
4 months ago