github.com/masx200/leetcode-test/count-complete-tree-nodes

Author: masx200

count-complete-tree-nodes/export.go

@@ -0,0 +1,7 @@
+package index
+import serialize_and_deserialize_binary_tree "github.com/masx200/leetcode-test/serialize-and-deserialize-binary-tree"
+
+func CountNodes(root *TreeNode) int {
+	return countNodes(root)
+}
+type TreeNode = serialize_and_deserialize_binary_tree.TreeNode

count-complete-tree-nodes/go.mod

@@ -0,0 +1,5 @@
+module github.com/masx200/leetcode-test/count-complete-tree-nodes
+
+go 1.19
+
+require github.com/masx200/leetcode-test/serialize-and-deserialize-binary-tree v0.0.0-20220906144335-3503ebe76485

count-complete-tree-nodes/go.sum

@@ -0,0 +1,6 @@
+github.com/google/go-cmp v0.5.8 h1:e6P7q2lk1O+qJJb4BtCQXlK8vWEO8V1ZeuEdJNOqZyg=
+github.com/masx200/leetcode-test/serialize-and-deserialize-binary-tree v0.0.0-20220825072430-380d3e0e30a2 h1:33VEOTS2x7yTFGGRWFVfNVyfgHgMKp3J44Cm40gv0WU=
+github.com/masx200/leetcode-test/serialize-and-deserialize-binary-tree v0.0.0-20220825072430-380d3e0e30a2/go.mod h1:WERZIbs/GoCIGQMt6FbOuDZBOkCi2oQlWFF88WfmKYI=
+github.com/masx200/leetcode-test/serialize-and-deserialize-binary-tree v0.0.0-20220906144335-3503ebe76485 h1:punpL7/3LN8fDFG5aRBnlGxyrfwWkngw9exLPtW7lzM=
+github.com/masx200/leetcode-test/serialize-and-deserialize-binary-tree v0.0.0-20220906144335-3503ebe76485/go.mod h1:WERZIbs/GoCIGQMt6FbOuDZBOkCi2oQlWFF88WfmKYI=
+gotest.tools/v3 v3.3.0 h1:MfDY1b1/0xN1CyMlQDac0ziEy9zJQd9CXBRRDHw2jJo=

count-complete-tree-nodes/index.go

@@ -0,0 +1,54 @@
+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))
+
+}

go.work

@@ -16,4 +16,5 @@ use (
 	./serialize-and-deserialize-binary-tree
 	./transform-to-chessboard
 	./utils
+    ./count-complete-tree-nodes
 )

rearrange-spaces-between-words/index.ts

@@ -7,7 +7,7 @@ export default function reorderSpaces(text: string): string {
         text,
         //@ts-ignore
         (a, v) => a + Number(v === " "),
-        0
+        0,
     ) as number;
 
     if (words.length <= 1) return words.join("") + " ".repeat(spaces);