https://leetcode.cn/problems/er-cha-shu-ran-se-UGC/

Author: masx200

README.md

@@ -10,6 +10,8 @@ leetcode 测试
 
 ### maven
 
+https://jitpack.io/#masx200/leetcode-test
+
 [![](https://jitpack.io/v/masx200/leetcode-test.svg)](https://jitpack.io/#masx200/leetcode-test)
 
 To get a Git project into your build:
@@ -19,29 +21,32 @@ Step 1. Add the JitPack repository to your build file
 maven
 
 ```xml
-	<repositories>
-		<repository>
-		    <id>jitpack.io</id>
-		    <url>https://jitpack.io</url>
-		</repository>
-	</repositories>
+<repositories>
+	<repository>
+	    <id>jitpack.io</id>
+	    <url>https://jitpack.io</url>
+	</repository>
+</repositories>
 ```
 
 Step 2. Add the dependency
 
 ```xml
-	<dependency>
-	    <groupId>com.github.masx200</groupId>
-	    <artifactId>leetcode-test</artifactId>
-	    <version>10.9.2</version>
-	</dependency>
+<dependency>
+    <groupId>com.github.masx200</groupId>
+    <artifactId>leetcode-test</artifactId>
+    <version>10.9.2</version>
+</dependency>
 ```
 
 ##### 包含的内容如下
 
 <details>
+
 <summary>展开查看</summary>
 
+https://leetcode.cn/problems/er-cha-shu-ran-se-UGC/
+
 https://leetcode.cn/problems/combination-sum-iii/
 
 https://leetcode.cn/problems/range-product-queries-of-powers/

er-cha-shu-ran-se-UGC/index.ts

@@ -0,0 +1,24 @@
+import { TreeNode } from "../binary-tree-inorder-traversal/TreeNode.ts";
+function maxValue(root: TreeNode | null, k: number) {
+    return Math.max(...dfs(root, k));
+}
+function dfs(root: TreeNode | null, k: number) {
+    const ans = Array(k + 1).fill(0);
+    if (!root) return ans;
+
+    const left = dfs(root.left, k);
+    const right = dfs(root.right, k);
+
+    ans.fill(left[k] + right[k]);
+
+    for (let i = 1; i <= k; i++) {
+        let temp = -Infinity;
+        for (let j = 0; j <= i - 1; j++) {
+            temp = Math.max(temp, left[j] + right[i - 1 - j]);
+        }
+        ans[i] = Math.max(ans[i], temp + root.val);
+    }
+
+    return ans;
+}
+export default maxValue;