update

leetcode-cn/originData/[no content]tree-diameter.json

@@ -12,7 +12,7 @@
             "translatedContent": null,
             "isPaidOnly": true,
             "difficulty": "Medium",
-            "likes": 85,
+            "likes": 90,
             "dislikes": 0,
             "isLiked": null,
             "similarQuestions": "[]",
@@ -36,11 +36,23 @@
                     "slug": "breadth-first-search",
                     "translatedName": "广度优先搜索",
                     "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Graph",
+                    "slug": "graph",
+                    "translatedName": "图",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Topological Sort",
+                    "slug": "topological-sort",
+                    "translatedName": "拓扑排序",
+                    "__typename": "TopicTagNode"
                 }
             ],
             "companyTagStats": null,
             "codeSnippets": null,
-            "stats": "{\"totalAccepted\": \"4.2K\", \"totalSubmission\": \"8.1K\", \"totalAcceptedRaw\": 4160, \"totalSubmissionRaw\": 8137, \"acRate\": \"51.1%\"}",
+            "stats": "{\"totalAccepted\": \"4.4K\", \"totalSubmission\": \"8.5K\", \"totalAcceptedRaw\": 4399, \"totalSubmissionRaw\": 8527, \"acRate\": \"51.6%\"}",
             "hints": [
                 "Start at any node A and traverse the tree to find the furthest node from it, let's call it B.",
                 "Having found the furthest node B, traverse the tree from B to find the furthest node from it, lets call it C.",