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

update

Browse Source
This commit is contained in:
小墨
2022-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
leetcode/originData/groups-of-strings.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 233,
"dislikes": 35,
"likes": 243,
"dislikes": 37,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Word Ladder II\", \"titleSlug\": \"word-ladder-ii\", \"difficulty\": \"Hard\", \"translatedTitle\": null}, {\"title\": \"Similar String Groups\", \"titleSlug\": \"similar-string-groups\", \"difficulty\": \"Hard\", \"translatedTitle\": null}, {\"title\": \"Largest Component Size by Common Factor\", \"titleSlug\": \"largest-component-size-by-common-factor\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
"exampleTestcases": "[\"a\",\"b\",\"ab\",\"cde\"]\n[\"a\",\"ab\",\"abc\"]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"5.3K\", \"totalSubmission\": \"21.5K\", \"totalAcceptedRaw\": 5252, \"totalSubmissionRaw\": 21465, \"acRate\": \"24.5%\"}",
"stats": "{\"totalAccepted\": \"5.4K\", \"totalSubmission\": \"22.1K\", \"totalAcceptedRaw\": 5440, \"totalSubmissionRaw\": 22138, \"acRate\": \"24.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.",