mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-05 07:21:40 +08:00
update
This commit is contained in:
@@ -11,8 +11,8 @@
|
||||
"translatedContent": null,
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Hard",
|
||||
"likes": 307,
|
||||
"dislikes": 3,
|
||||
"likes": 324,
|
||||
"dislikes": 4,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[{\"title\": \"Number of Islands II\", \"titleSlug\": \"number-of-islands-ii\", \"difficulty\": \"Hard\", \"translatedTitle\": null}, {\"title\": \"Smallest String With Swaps\", \"titleSlug\": \"smallest-string-with-swaps\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Maximum Employees to Be Invited to a Meeting\", \"titleSlug\": \"maximum-employees-to-be-invited-to-a-meeting\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
|
||||
"exampleTestcases": "3\n[[0,1]]\n[[0,2],[2,1]]\n3\n[[0,1]]\n[[1,2],[0,2]]\n5\n[[0,1],[1,2],[2,3]]\n[[0,4],[1,2],[3,1],[3,4]]",
|
||||
@@ -143,7 +143,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"8.9K\", \"totalSubmission\": \"16.5K\", \"totalAcceptedRaw\": 8861, \"totalSubmissionRaw\": 16542, \"acRate\": \"53.6%\"}",
|
||||
"stats": "{\"totalAccepted\": \"9.6K\", \"totalSubmission\": \"17.8K\", \"totalAcceptedRaw\": 9581, \"totalSubmissionRaw\": 17778, \"acRate\": \"53.9%\"}",
|
||||
"hints": [
|
||||
"For each request, we could loop through all restrictions. Can you think of doing a check-in close to O(1)?",
|
||||
"Could you use Union Find?"
|
||||
|
Reference in New Issue
Block a user