mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-04 23:11:41 +08:00
update
This commit is contained in:
@@ -11,8 +11,8 @@
|
||||
"translatedContent": null,
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Medium",
|
||||
"likes": 1957,
|
||||
"dislikes": 31,
|
||||
"likes": 2041,
|
||||
"dislikes": 32,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[]",
|
||||
"exampleTestcases": "4\n[[0,1],[0,2],[1,2]]\n6\n[[0,1],[0,2],[0,3],[1,2],[1,3]]\n6\n[[0,1],[0,2],[0,3],[1,2]]",
|
||||
@@ -155,7 +155,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"70.6K\", \"totalSubmission\": \"122.5K\", \"totalAcceptedRaw\": 70594, \"totalSubmissionRaw\": 122503, \"acRate\": \"57.6%\"}",
|
||||
"stats": "{\"totalAccepted\": \"74.3K\", \"totalSubmission\": \"128.8K\", \"totalAcceptedRaw\": 74287, \"totalSubmissionRaw\": 128752, \"acRate\": \"57.7%\"}",
|
||||
"hints": [
|
||||
"As long as there are at least (n - 1) connections, there is definitely a way to connect all computers.",
|
||||
"Use DFS to determine the number of isolated computer clusters."
|
||||
|
Reference in New Issue
Block a user