package er_cha_sou_suo_shu_de_di_kda_jie_dian_lcof

Author: masx200

er-cha-shu-ren-wu-diao-du/index.ts

@@ -1,23 +1,23 @@
-import { TreeNode } from "../binary-tree-inorder-traversal/TreeNode.ts";
-
-function minimalExecTime(root: TreeNode | null) {
-    const res = execTime(root);
-    return res[0];
-}
-
-function execTime(node: TreeNode | null): [number, number] {
-    if (node == null) {
-        // [0]执行完当前节点最小耗时，[1]当前node为根的时间串行之和
-        return [0, 0];
-    }
-    // 获取左右子树的值
-    const leftTime = execTime(node.left);
-    const rightTime = execTime(node.right);
-    // 左右子树节点之和
-    const sum = leftTime[1] + rightTime[1];
-    // 当前节点执行完的最小消耗时间
-    const minTime =
-        Math.max(Math.max(leftTime[0], rightTime[0]), sum / 2) + node.val;
-    return [minTime, sum + node.val];
-}
-export default minimalExecTime;
+import { TreeNode } from "../binary-tree-inorder-traversal/TreeNode.ts";
+
+function minimalExecTime(root: TreeNode | null) {
+    const res = execTime(root);
+    return res[0];
+}
+
+function execTime(node: TreeNode | null): [number, number] {
+    if (node == null) {
+        // [0]执行完当前节点最小耗时，[1]当前node为根的时间串行之和
+        return [0, 0];
+    }
+    // 获取左右子树的值
+    const leftTime = execTime(node.left);
+    const rightTime = execTime(node.right);
+    // 左右子树节点之和
+    const sum = leftTime[1] + rightTime[1];
+    // 当前节点执行完的最小消耗时间
+    const minTime = Math.max(Math.max(leftTime[0], rightTime[0]), sum / 2) +
+        node.val;
+    return [minTime, sum + node.val];
+}
+export default minimalExecTime;

er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof/KthLargest_test.go

@@ -0,0 +1,15 @@
+package er_cha_sou_suo_shu_de_di_kda_jie_dian_lcof
+
+import (
+	"testing"
+
+	"github.com/masx200/leetcode-test/utils"
+	"gotest.tools/v3/assert"
+)
+
+var TreeNodeLeetCodeParse = utils.TreeNodeLeetCodeParse
+
+func TestKthLargest(t *testing.T) {
+	assert.Equal(t, 4, (kthLargest(TreeNodeLeetCodeParse("[3,1,4,null,2]"), 1)))
+	assert.Equal(t, 4, (kthLargest(TreeNodeLeetCodeParse(" [5,3,6,2,4,null,null,1]"), 3)))
+}

er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof/index.go

@@ -0,0 +1,50 @@
+package er_cha_sou_suo_shu_de_di_kda_jie_dian_lcof
+
+import serialize_and_deserialize_binary_tree "github.com/masx200/leetcode-test/serialize-and-deserialize-binary-tree"
+
+import (
+	"errors"
+)
+
+func KthLargest(root *TreeNode, k int) int {
+	return kthLargest(root, k)
+}
+
+type TreeNode = serialize_and_deserialize_binary_tree.TreeNode
+
+func kthLargest(root *TreeNode, k int) int {
+	i := 1
+	gen := ReverseInOrderIterator(root)
+
+	for v := range gen {
+
+		if i == k {
+			return v
+		}
+		i++
+	}
+	panic(errors.New("unreachable"))
+}
+func ReverseInOrderIterator(root *TreeNode) (gen chan int) {
+	gen = make(chan int)
+
+	if root == nil {
+		close(gen)
+		return
+	}
+	go func() {
+		WriteAll(gen, ReverseInOrderIterator(root.Right))
+
+		gen <- root.Val
+		WriteAll(gen, ReverseInOrderIterator(root.Left))
+		close(gen)
+	}()
+
+	return
+}
+func WriteAll(target chan int, source chan int) {
+
+	for v := range source {
+		target <- v
+	}
+}