mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-10-22 21:46:46 +08:00
update
This commit is contained in:
@@ -149,7 +149,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"2.7K\", \"totalSubmission\": \"9K\", \"totalAcceptedRaw\": 2664, \"totalSubmissionRaw\": 9035, \"acRate\": \"29.5%\"}",
|
||||
"stats": "{\"totalAccepted\": \"2.7K\", \"totalSubmission\": \"9.1K\", \"totalAcceptedRaw\": 2676, \"totalSubmissionRaw\": 9059, \"acRate\": \"29.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