1
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
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

View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 246,
"dislikes": 4,
"likes": 252,
"dislikes": 5,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Rank Transform of a Matrix\", \"titleSlug\": \"rank-transform-of-a-matrix\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
"exampleTestcases": "[7,21,3]\n[5,2,6,2]\n[10,5,9,3,15]",
@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"4.5K\", \"totalSubmission\": \"9.9K\", \"totalAcceptedRaw\": 4514, \"totalSubmissionRaw\": 9927, \"acRate\": \"45.5%\"}",
"stats": "{\"totalAccepted\": \"4.6K\", \"totalSubmission\": \"10.2K\", \"totalAcceptedRaw\": 4633, \"totalSubmissionRaw\": 10189, \"acRate\": \"45.5%\"}",
"hints": [
"Can we build a graph with all the prime numbers and the original array?",
"We can use union-find to determine which indices are connected (i.e., which indices can be swapped)."