feat: add solutions to lc problem: No.3313 (doocs#3626)

No.3313.Find the Last Marked Nodes in Tree

Author: yanglbme

solution/3300-3399/3313.Find the Last Marked Nodes in Tree/README.md

@@ -216,17 +216,13 @@ public:
             g[u].push_back(v);
             g[v].push_back(u);
         }
-        auto max_node = [&](const vector<int>& dist) {
-            int mx = ranges::max(dist);
-            return ranges::find(dist, mx) - dist.begin();
-        };
         vector<int> dist1(n);
         dfs(0, -1, dist1);
-        int a = max_node(dist1);
+        int a = max_element(dist1.begin(), dist1.end()) - dist1.begin();
 
         vector<int> dist2(n);
         dfs(a, -1, dist2);
-        int b = max_node(dist2);
+        int b = max_element(dist2.begin(), dist2.end()) - dist2.begin();
 
         vector<int> dist3(n);
         dfs(b, -1, dist3);
@@ -342,6 +338,48 @@ function lastMarkedNodes(edges: number[][]): number[] {
 }
 ```
 
+#### JavaScript
+
+```js
+/**
+ * @param {number[][]} edges
+ * @return {number[]}
+ */
+var lastMarkedNodes = function (edges) {
+    const n = edges.length + 1;
+    const g = Array.from({ length: n }, () => []);
+    for (const [u, v] of edges) {
+        g[u].push(v);
+        g[v].push(u);
+    }
+    const dfs = (i, fa, dist) => {
+        for (const j of g[i]) {
+            if (j !== fa) {
+                dist[j] = dist[i] + 1;
+                dfs(j, i, dist);
+            }
+        }
+    };
+
+    const dist1 = Array(n).fill(0);
+    dfs(0, -1, dist1);
+    const a = dist1.indexOf(Math.max(...dist1));
+
+    const dist2 = Array(n).fill(0);
+    dfs(a, -1, dist2);
+    const b = dist2.indexOf(Math.max(...dist2));
+
+    const dist3 = Array(n).fill(0);
+    dfs(b, -1, dist3);
+
+    const ans = [];
+    for (let i = 0; i < n; ++i) {
+        ans.push(dist2[i] > dist3[i] ? a : b);
+    }
+    return ans;
+};
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/3300-3399/3313.Find the Last Marked Nodes in Tree/README_EN.md

@@ -216,17 +216,13 @@ public:
             g[u].push_back(v);
             g[v].push_back(u);
         }
-        auto max_node = [&](const vector<int>& dist) {
-            int mx = ranges::max(dist);
-            return ranges::find(dist, mx) - dist.begin();
-        };
         vector<int> dist1(n);
         dfs(0, -1, dist1);
-        int a = max_node(dist1);
+        int a = max_element(dist1.begin(), dist1.end()) - dist1.begin();
 
         vector<int> dist2(n);
         dfs(a, -1, dist2);
-        int b = max_node(dist2);
+        int b = max_element(dist2.begin(), dist2.end()) - dist2.begin();
 
         vector<int> dist3(n);
         dfs(b, -1, dist3);
@@ -342,6 +338,48 @@ function lastMarkedNodes(edges: number[][]): number[] {
 }
 ```
 
+#### JavaScript
+
+```js
+/**
+ * @param {number[][]} edges
+ * @return {number[]}
+ */
+var lastMarkedNodes = function (edges) {
+    const n = edges.length + 1;
+    const g = Array.from({ length: n }, () => []);
+    for (const [u, v] of edges) {
+        g[u].push(v);
+        g[v].push(u);
+    }
+    const dfs = (i, fa, dist) => {
+        for (const j of g[i]) {
+            if (j !== fa) {
+                dist[j] = dist[i] + 1;
+                dfs(j, i, dist);
+            }
+        }
+    };
+
+    const dist1 = Array(n).fill(0);
+    dfs(0, -1, dist1);
+    const a = dist1.indexOf(Math.max(...dist1));
+
+    const dist2 = Array(n).fill(0);
+    dfs(a, -1, dist2);
+    const b = dist2.indexOf(Math.max(...dist2));
+
+    const dist3 = Array(n).fill(0);
+    dfs(b, -1, dist3);
+
+    const ans = [];
+    for (let i = 0; i < n; ++i) {
+        ans.push(dist2[i] > dist3[i] ? a : b);
+    }
+    return ans;
+};
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/3300-3399/3313.Find the Last Marked Nodes in Tree/Solution.cpp

@@ -8,17 +8,13 @@ class Solution {
             g[u].push_back(v);
             g[v].push_back(u);
         }
-        auto max_node = [&](const vector<int>& dist) {
-            int mx = ranges::max(dist);
-            return ranges::find(dist, mx) - dist.begin();
-        };
         vector<int> dist1(n);
         dfs(0, -1, dist1);
-        int a = max_node(dist1);
+        int a = max_element(dist1.begin(), dist1.end()) - dist1.begin();
 
         vector<int> dist2(n);
         dfs(a, -1, dist2);
-        int b = max_node(dist2);
+        int b = max_element(dist2.begin(), dist2.end()) - dist2.begin();
 
         vector<int> dist3(n);
         dfs(b, -1, dist3);

solution/3300-3399/3313.Find the Last Marked Nodes in Tree/Solution.js

@@ -0,0 +1,37 @@
+/**
+ * @param {number[][]} edges
+ * @return {number[]}
+ */
+var lastMarkedNodes = function (edges) {
+    const n = edges.length + 1;
+    const g = Array.from({ length: n }, () => []);
+    for (const [u, v] of edges) {
+        g[u].push(v);
+        g[v].push(u);
+    }
+    const dfs = (i, fa, dist) => {
+        for (const j of g[i]) {
+            if (j !== fa) {
+                dist[j] = dist[i] + 1;
+                dfs(j, i, dist);
+            }
+        }
+    };
+
+    const dist1 = Array(n).fill(0);
+    dfs(0, -1, dist1);
+    const a = dist1.indexOf(Math.max(...dist1));
+
+    const dist2 = Array(n).fill(0);
+    dfs(a, -1, dist2);
+    const b = dist2.indexOf(Math.max(...dist2));
+
+    const dist3 = Array(n).fill(0);
+    dfs(b, -1, dist3);
+
+    const ans = [];
+    for (let i = 0; i < n; ++i) {
+        ans.push(dist2[i] > dist3[i] ? a : b);
+    }
+    return ans;
+};