mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-05 23:41:41 +08:00
update
This commit is contained in:
@@ -155,7 +155,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"3.8K\", \"totalSubmission\": \"12K\", \"totalAcceptedRaw\": 3790, \"totalSubmissionRaw\": 12002, \"acRate\": \"31.6%\"}",
|
||||
"stats": "{\"totalAccepted\": \"3.8K\", \"totalSubmission\": \"12K\", \"totalAcceptedRaw\": 3791, \"totalSubmissionRaw\": 12008, \"acRate\": \"31.6%\"}",
|
||||
"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