maxCount2 is the maximum value of count2[j] (computed across all nodes j in the second tree).
Code

[{"language":"Java","code":"class Solution {\n\n    public int[] maxTargetNodes(int[][] edges1, int[][] edges2, int k) {\n        int n = edges1.length + 1, m = edges2.length + 1;\n\n        // Precompute reachable counts\n        int[] count1 = precomputeDFS(edges1, k);\n        int[] count2 = precomputeDFS(edges2, k - 1);\n\n        // Find the maximum count from the second tree\n        int maxCount2 = 0;\n        for (int c : count2) {\n            maxCount2 = Math.max(maxCount2, c);\n        }\n\n        // Compute the results using count1 and maxCount2\n        int[] res = new int[n];\n        for (int i = 0; i < n; i++) {\n            res[i] = count1[i] + maxCount2;\n        }\n        return res;\n    }\n\n    // Build adjacency list and compute reachable counts using DFS\n    private int[] precomputeDFS(int[][] edges, int k) {\n        int n = edges.length + 1;\n        List<List<Integer>> tree = new ArrayList<>();\n        for (int i = 0; i < n; i++) {\n            tree.add(new ArrayList<>());\n        }\n        for (int[] edge : edges) {\n            tree.get(edge[0]).add(edge[1]);\n            tree.get(edge[1]).add(edge[0]);\n        }\n\n        int[] reachable = new int[n];\n        for (int i = 0; i < n; i++) {\n            reachable[i] = dfs(tree, i, -1, k);\n        }\n        return reachable;\n    }\n\n    // DFS to count reachable nodes within a distance of `k`\n    private int dfs(List<List<Integer>> tree, int node, int parent, int k) {\n        if (k < 0) {\n            return 0;\n        }\n        int count = 1; // Current node counts as reachable\n        for (int neighbour : tree.get(node)) {\n            if (neighbour != parent) {\n                count += dfs(tree, neighbour, node, k - 1);\n            }\n        }\n        return count;\n    }\n}","lang":"java","html":"<pre class=\"shiki shiki-themes github-light github-dark\" style=\"background-color:#fff;--shiki-dark-bg:#24292e;color:#24292e;--shiki-dark:#e1e4e8\" tabindex=\"0\"><code><span class=\"line\"><span style=\"color:#D73A49;--shiki-dark:#F97583\">class</span><span style=\"color:#6F42C1;--shiki-dark:#B392F0\"> Solution</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\"> {</span></span>\n<span class=\"line\"></span>\n<span class=\"line\"><span style=\"color:#D73A49;--shiki-dark:#F97583\">    public</span><span style=\"color:#D73A49;--shiki-dark:#F97583\"> int</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\">[] </span><span style=\"color:#6F42C1;--shiki-dark:#B392F0\">maxTargetNodes</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\">(</span><span style=\"color:#D73A49;--shiki-dark:#F97583\">int</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\">[][] </span><span style=\"color:#E36209;--shiki-dark:#FFAB70\">edges1</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\">, </span><span style=\"color:#D73A49;--shiki-dark:#F97583\">int</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\">[]
Related Tags
