update

leetcode/originData/[no content]graph-valid-tree.json

@@ -11,8 +11,8 @@
             "translatedContent": null,
             "isPaidOnly": true,
             "difficulty": "Medium",
-            "likes": 2282,
-            "dislikes": 58,
+            "likes": 2350,
+            "dislikes": 61,
             "isLiked": null,
             "similarQuestions": "[{\"title\": \"Course Schedule\", \"titleSlug\": \"course-schedule\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Number of Connected Components in an Undirected Graph\", \"titleSlug\": \"number-of-connected-components-in-an-undirected-graph\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Keys and Rooms\", \"titleSlug\": \"keys-and-rooms\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
             "exampleTestcases": "5\n[[0,1],[0,2],[0,3],[1,4]]\n5\n[[0,1],[1,2],[2,3],[1,3],[1,4]]",
@@ -46,7 +46,7 @@
             ],
             "companyTagStats": null,
             "codeSnippets": null,
-            "stats": "{\"totalAccepted\": \"248K\", \"totalSubmission\": \"543.5K\", \"totalAcceptedRaw\": 248030, \"totalSubmissionRaw\": 543525, \"acRate\": \"45.6%\"}",
+            "stats": "{\"totalAccepted\": \"255.5K\", \"totalSubmission\": \"558.5K\", \"totalAcceptedRaw\": 255471, \"totalSubmissionRaw\": 558492, \"acRate\": \"45.7%\"}",
             "hints": [
                 "Given <code>n = 5</code> and <code>edges = [[0, 1], [1, 2], [3, 4]]</code>, what should your return? Is this case a valid tree?",
                 "According to the <a href=\"https://en.wikipedia.org/wiki/Tree_(graph_theory)\" target=\"_blank\">definition of tree on Wikipedia</a>: “a tree is an undirected graph in which any two vertices are connected by <i>exactly</i> one path. In other words, any connected graph without simple cycles is a tree.”"