mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-04 06:51:41 +08:00
update
This commit is contained in:
@@ -149,7 +149,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"5.2K\", \"totalSubmission\": \"21.4K\", \"totalAcceptedRaw\": 5235, \"totalSubmissionRaw\": 21414, \"acRate\": \"24.4%\"}",
|
||||
"stats": "{\"totalAccepted\": \"5.3K\", \"totalSubmission\": \"21.5K\", \"totalAcceptedRaw\": 5252, \"totalSubmissionRaw\": 21465, \"acRate\": \"24.5%\"}",
|
||||
"hints": [
|
||||
"Can we build a graph from words, where there exists an edge between nodes i and j if words[i] and words[j] are connected?",
|
||||
"The problem now boils down to finding the total number of components and the size of the largest component in the graph.",
|
||||
|
Reference in New Issue
Block a user