coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 07:21:40 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
leetcode-cn/originData/[no content]graph-valid-tree.json
View File

@@ -12,7 +12,7 @@
"translatedContent": null,
"isPaidOnly": true,
"difficulty": "Medium",
"likes": 161,
"likes": 165,
"dislikes": 0,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Course Schedule\", \"titleSlug\": \"course-schedule\", \"difficulty\": \"Medium\", \"translatedTitle\": \"\\u8bfe\\u7a0b\\u8868\"}, {\"title\": \"Number of Connected Components in an Undirected Graph\", \"titleSlug\": \"number-of-connected-components-in-an-undirected-graph\", \"difficulty\": \"Medium\", \"translatedTitle\": \"\\u65e0\\u5411\\u56fe\\u4e2d\\u8fde\\u901a\\u5206\\u91cf\\u7684\\u6570\\u76ee\"}]",
@@ -46,7 +46,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"11.4K\", \"totalSubmission\": \"22.8K\", \"totalAcceptedRaw\": 11435, \"totalSubmissionRaw\": 22779, \"acRate\": \"50.2%\"}",
"stats": "{\"totalAccepted\": \"12K\", \"totalSubmission\": \"23.8K\", \"totalAcceptedRaw\": 11992, \"totalSubmissionRaw\": 23783, \"acRate\": \"50.4%\"}",
"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.”"