coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-06 07:51:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2023-12-09 19:57:46 +08:00
parent 9bc4722a45
commit 3770b44d1e
4792 changed files with 10889 additions and 10886 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
leetcode/originData/smallest-number-in-infinite-set.json
View File

@@ -12,7 +12,7 @@
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 1521,
"dislikes": 162,
"dislikes": 163,
"isLiked": null,
"similarQuestions": "[{\"title\": \"First Missing Positive\", \"titleSlug\": \"first-missing-positive\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
"exampleTestcases": "[\"SmallestInfiniteSet\",\"addBack\",\"popSmallest\",\"popSmallest\",\"popSmallest\",\"addBack\",\"popSmallest\",\"popSmallest\",\"popSmallest\"]\n[[],[2],[],[],[],[1],[],[],[]]",
@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"110.7K\", \"totalSubmission\": \"152.1K\", \"totalAcceptedRaw\": 110726, \"totalSubmissionRaw\": 152083, \"acRate\": \"72.8%\"}",
"stats": "{\"totalAccepted\": \"110.8K\", \"totalSubmission\": \"152.2K\", \"totalAcceptedRaw\": 110828, \"totalSubmissionRaw\": 152222, \"acRate\": \"72.8%\"}",
"hints": [
"Based on the constraints, what is the maximum element that can possibly be popped?",
"Maintain whether elements are in or not in the set. How many elements do we consider?"