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

update

Browse Source
This commit is contained in:
小墨
2023-12-09 19:57:46 +08:00
parent 9bc4722a45
commit 3770b44d1e
4792 changed files with 10889 additions and 10886 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
leetcode/originData/count-the-number-of-complete-components.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 541,
"likes": 544,
"dislikes": 13,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Number of Connected Components in an Undirected Graph\", \"titleSlug\": \"number-of-connected-components-in-an-undirected-graph\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"20.2K\", \"totalSubmission\": \"31K\", \"totalAcceptedRaw\": 20161, \"totalSubmissionRaw\": 31032, \"acRate\": \"65.0%\"}",
"stats": "{\"totalAccepted\": \"20.2K\", \"totalSubmission\": \"31K\", \"totalAcceptedRaw\": 20168, \"totalSubmissionRaw\": 31044, \"acRate\": \"65.0%\"}",
"hints": [
"Find the connected components of an undirected graph using depth-first search (DFS) or breadth-first search (BFS).",
"For each connected component, count the number of nodes and edges in the component.",