update: 添加问题“3372.连接两棵树后最大目标节点数目I”的代码和题解(#962)

LetMeFly666 · web-flow · commit 83104568b30b · 2025-05-29T13:54:40.000+08:00
* 3372: WA.cpp (#961) Signed-off-by: LetMeFly666 <814114971@qq.com> * 3372: WA.cpp (#961) Signed-off-by: LetMeFly666 <814114971@qq.com> * 3372: WA.cpp (#961) Signed-off-by: LetMeFly666 <814114971@qq.com> * 3372: AC.(cpp+py)+CE.java (#961) cpp - AC,75.44%,71.93% py - AC,88.89%,66.67% Signed-off-by: LetMeFly666 <814114971@qq.com> * 3372: CE.java (#961) Signed-off-by: LetMeFly666 <814114971@qq.com> * 3372: AC.java (#961) java - AC,92.00%,96.00% Signed-off-by: LetMeFly666 <814114971@qq.com> * 3372: WA.go (#961) Signed-off-by: LetMeFly666 <814114971@qq.com> * 3372: AC.go (#961) AC,50.00%,87.50% Signed-off-by: LetMeFly666 <814114971@qq.com> * update: 添加问题“3372.连接两棵树后最大目标节点数目I”的代码和题解(#962) Signed-off-by: LetMeFly666 <814114971@qq.com> * fix: 空间复杂度(#962) Signed-off-by: LetMeFly666 <814114971@qq.com> --------- Signed-off-by: LetMeFly666 <814114971@qq.com>
diff --git a/Codes/3372-maximize-the-number-of-target-nodes-after-connecting-trees-i.cpp b/Codes/3372-maximize-the-number-of-target-nodes-after-connecting-trees-i.cpp
@@ -0,0 +1,49 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-05-28 21:43:27
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-05-28 22:55:41
+ */
+#if defined(_WIN32) || defined(__APPLE__)
+#include "_[1,2]toVector.h"
+#endif
+
+class Solution {
+private:
+    vector<vector<int>> buildTree(vector<vector<int>>& edges) {
+        vector<vector<int>> graph(edges.size() + 1);
+        for (vector<int>& edge : edges) {
+            graph[edge[0]].push_back(edge[1]);
+            graph[edge[1]].push_back(edge[0]);
+        }
+        return graph;
+    }
+
+    int dfs(vector<vector<int>>& graph, int lastNode, int thisNode, int k) {
+        if (k < 0) {
+            return 0;
+        }
+        int ans = 1;
+        for (int nextNode : graph[thisNode]) {
+            if (nextNode == lastNode) {
+                continue;
+            }
+            ans += dfs(graph, thisNode, nextNode, k - 1);
+        }
+        return ans;
+    }
+public:
+    vector<int> maxTargetNodes(vector<vector<int>>& edges1, vector<vector<int>>& edges2, int k) {
+        vector<vector<int>> graph2 = buildTree(edges2);
+        int add = 0;
+        for (int i = 0; i <= edges2.size(); i++) {
+            add = max(add, dfs(graph2, -1, i, k - 1));
+        }
+        vector<vector<int>> graph1 = buildTree(edges1);
+        vector<int> ans(graph1.size());
+        for (int i = 0; i < ans.size(); i++) {
+            ans[i] = dfs(graph1, -1, i, k) + add;
+        }
+        return ans;
+    }
+};
diff --git a/Codes/3372-maximize-the-number-of-target-nodes-after-connecting-trees-i.go b/Codes/3372-maximize-the-number-of-target-nodes-after-connecting-trees-i.go
@@ -0,0 +1,43 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-05-28 21:43:27
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-05-29 00:43:41
+ */
+package main
+
+func buildTree3372(edges [][]int) [][]int {
+    ans := make([][]int, len(edges) + 1)
+    for _, edge := range edges {
+        ans[edge[0]] = append(ans[edge[0]], edge[1])
+        ans[edge[1]] = append(ans[edge[1]], edge[0])
+    }
+    return ans
+}
+
+func dfs3372(tree [][]int, lastNode, thisNode, k int) int {
+    if k < 0 {
+        return 0
+    }
+    ans := 1
+    for _, nextNode := range tree[thisNode] {
+        if nextNode != lastNode {
+            ans += dfs3372(tree, thisNode, nextNode, k - 1)
+        }
+    }
+    return ans
+}
+
+func maxTargetNodes(edges1 [][]int, edges2 [][]int, k int) []int {
+    tree2 := buildTree3372(edges2)
+    toAdd := 0
+    for i := range tree2 {
+        toAdd = max(toAdd, dfs3372(tree2, -1, i, k - 1))
+    }
+    tree1 := buildTree3372(edges1)
+    ans := make([]int, len(tree1))
+    for i := range ans {
+        ans[i] = toAdd + dfs3372(tree1, -1, i, k)
+    }
+    return ans
+}
diff --git a/Codes/3372-maximize-the-number-of-target-nodes-after-connecting-trees-i.java b/Codes/3372-maximize-the-number-of-target-nodes-after-connecting-trees-i.java
@@ -0,0 +1,49 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-05-28 21:43:27
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-05-28 23:21:21
+ */
+import java.util.List;
+import java.util.ArrayList;
+
+class Solution {
+    private List<Integer>[] buildTree(int[][] edges) {
+        List<Integer>[] ans = new ArrayList[edges.length + 1];
+        for (int i = 0; i < ans.length; i++) {
+            ans[i] = new ArrayList<>();
+        }
+        for (int[] edge : edges) {
+            ans[edge[0]].add(edge[1]);
+            ans[edge[1]].add(edge[0]);
+        }
+        return ans;
+    }
+
+    private int dfs(List<Integer>[] tree, int lastNode, int thisNode, int k) {
+        if (k < 0) {
+            return 0;
+        }
+        int ans = 1;
+        for (int nextNode : tree[thisNode]) {
+            if (nextNode != lastNode) {
+                ans += dfs(tree, thisNode, nextNode, k - 1);
+            }
+        }
+        return ans;
+    }
+
+    public int[] maxTargetNodes(int[][] edges1, int[][] edges2, int k) {
+        List<Integer>[] tree2 = buildTree(edges2);
+        int add = 0;
+        for (int i = 0; i < tree2.length; i++) {
+            add = Math.max(add, dfs(tree2, -1, i, k - 1));
+        }
+        List<Integer>[] tree1 = buildTree(edges1);
+        int[] ans = new int[tree1.length];
+        for (int i = 0; i < ans.length; i++) {
+            ans[i] = add + dfs(tree1, -1, i, k);
+        }
+        return ans;
+    }
+}
diff --git a/Codes/3372-maximize-the-number-of-target-nodes-after-connecting-trees-i.py b/Codes/3372-maximize-the-number-of-target-nodes-after-connecting-trees-i.py
@@ -0,0 +1,30 @@
+'''
+Author: LetMeFly
+Date: 2025-05-28 21:43:27
+LastEditors: LetMeFly.xyz
+LastEditTime: 2025-05-28 23:05:02
+'''
+from typing import List
+
+class Solution:
+    def buildTree(self, edges: List[List[int]]) -> List[List[int]]:
+        ans = [[] for _ in range(len(edges) + 1)]
+        for x, y in edges:
+            ans[x].append(y)
+            ans[y].append(x)
+        return ans
+    
+    def dfs(self, tree: List[List[int]], lastNode: int, thisNode: int, k: int) -> int:
+        if k < 0:
+            return 0
+        ans = 1
+        for nextNode in tree[thisNode]:
+            if nextNode != lastNode:
+                ans += self.dfs(tree, thisNode, nextNode, k - 1)
+        return ans
+    
+    def maxTargetNodes(self, edges1: List[List[int]], edges2: List[List[int]], k: int) -> List[int]:
+        tree2 = self.buildTree(edges2)
+        toAdd = max(self.dfs(tree2, -1, i, k - 1) for i in range(len(tree2)))
+        tree1 = self.buildTree(edges1)
+        return [self.dfs(tree1, -1, i, k) + toAdd for i in range(len(tree1))]
diff --git a/README.md b/README.md
@@ -979,6 +979,7 @@
 |3355.零数组变换I|中等|<a href="https://leetcode.cn/problems/zero-array-transformation-i/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/05/21/LeetCode%203355.%E9%9B%B6%E6%95%B0%E7%BB%84%E5%8F%98%E6%8D%A2I/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/148126611" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/zero-array-transformation-i/solutions/3683113/letmefly-3355ling-shu-zu-bian-huan-ichai-njzr/" target="_blank">LeetCode题解</a>|
 |3356.零数组变换II|中等|<a href="https://leetcode.cn/problems/zero-array-transformation-ii/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/05/22/LeetCode%203356.%E9%9B%B6%E6%95%B0%E7%BB%84%E5%8F%98%E6%8D%A2II/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/148151470" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/zero-array-transformation-ii/solutions/3683924/letmefly-3356ling-shu-zu-bian-huan-iier-zrey9/" target="_blank">LeetCode题解</a>|
 |3362.零数组变换III|中等|<a href="https://leetcode.cn/problems/zero-array-transformation-iii/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/05/24/LeetCode%203362.%E9%9B%B6%E6%95%B0%E7%BB%84%E5%8F%98%E6%8D%A2III/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/148192450" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/zero-array-transformation-iii/solutions/3684942/letmefly-3362ling-shu-zu-bian-huan-iiita-qfve/" target="_blank">LeetCode题解</a>|
+|3372.连接两棵树后最大目标节点数目I|中等|<a href="https://leetcode.cn/problems/maximize-the-number-of-target-nodes-after-connecting-trees-i/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/05/29/LeetCode%203372.%E8%BF%9E%E6%8E%A5%E4%B8%A4%E6%A3%B5%E6%A0%91%E5%90%8E%E6%9C%80%E5%A4%A7%E7%9B%AE%E6%A0%87%E8%8A%82%E7%82%B9%E6%95%B0%E7%9B%AEI/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/148308690" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/maximize-the-number-of-target-nodes-after-connecting-trees-i/solutions/3688776/letmefly-3372lian-jie-liang-ke-shu-hou-z-l917/" target="_blank">LeetCode题解</a>|
 |3375.使数组的值全部为K的最少操作次数|简单|<a href="https://leetcode.cn/problems/minimum-operations-to-make-array-values-equal-to-k/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/04/09/LeetCode%203375.%E4%BD%BF%E6%95%B0%E7%BB%84%E7%9A%84%E5%80%BC%E5%85%A8%E9%83%A8%E4%B8%BAK%E7%9A%84%E6%9C%80%E5%B0%91%E6%93%8D%E4%BD%9C%E6%AC%A1%E6%95%B0/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/147104288" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/minimum-operations-to-make-array-values-equal-to-k/solutions/3646138/letmefly-3375shi-shu-zu-de-zhi-quan-bu-w-i71e/" target="_blank">LeetCode题解</a>|
 |3392.统计符合条件长度为3的子数组数目|简单|<a href="https://leetcode.cn/problems/count-subarrays-of-length-three-with-a-condition/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/04/29/LeetCode%203392.%E7%BB%9F%E8%AE%A1%E7%AC%A6%E5%90%88%E6%9D%A1%E4%BB%B6%E9%95%BF%E5%BA%A6%E4%B8%BA3%E7%9A%84%E5%AD%90%E6%95%B0%E7%BB%84%E6%95%B0%E7%9B%AE/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/147603015" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/count-subarrays-of-length-three-with-a-condition/solutions/3665081/letmefly-3392tong-ji-fu-he-tiao-jian-cha-h935/" target="_blank">LeetCode题解</a>|
 |3396.使数组元素互不相同所需的最少操作次数|简单|<a href="https://leetcode.cn/problems/minimum-number-of-operations-to-make-elements-in-array-distinct/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/04/08/LeetCode%203396.%E4%BD%BF%E6%95%B0%E7%BB%84%E5%85%83%E7%B4%A0%E4%BA%92%E4%B8%8D%E7%9B%B8%E5%90%8C%E6%89%80%E9%9C%80%E7%9A%84%E6%9C%80%E5%B0%91%E6%93%8D%E4%BD%9C%E6%AC%A1%E6%95%B0/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/147080178" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/minimum-number-of-operations-to-make-elements-in-array-distinct/solutions/3644951/letmefly-3396shi-shu-zu-yuan-su-hu-bu-xi-glg4/" target="_blank">LeetCode题解</a>|
diff --git a/Solutions/LeetCode 3372.连接两棵树后最大目标节点数目I.md b/Solutions/LeetCode 3372.连接两棵树后最大目标节点数目I.md
diff --git a/tryGoPy/MGJW/thisWeek/周报.md b/tryGoPy/MGJW/thisWeek/周报.md
