coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-07 00:11:41 +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-unreachable-pairs-of-nodes-in-an-undirected-graph.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 1910,
"likes": 1911,
"dislikes": 44,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Number of Islands\", \"titleSlug\": \"number-of-islands\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"79.8K\", \"totalSubmission\": \"159.9K\", \"totalAcceptedRaw\": 79762, \"totalSubmissionRaw\": 159862, \"acRate\": \"49.9%\"}",
"stats": "{\"totalAccepted\": \"79.8K\", \"totalSubmission\": \"159.9K\", \"totalAcceptedRaw\": 79783, \"totalSubmissionRaw\": 159914, \"acRate\": \"49.9%\"}",
"hints": [
"Find the connected components of the graph. To find connected components, you can use Union Find (Disjoint Sets), BFS, or DFS.",
"For a node u, the number of nodes that are unreachable from u is the number of nodes that are not in the same connected component as u.",