coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 07:21: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/[no content]missing-element-in-sorted-array.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": true,
"difficulty": "Medium",
"likes": 1248,
"dislikes": 50,
"likes": 1278,
"dislikes": 51,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[4,7,9,10]\n1\n[4,7,9,10]\n3\n[1,2,4]\n3",
@@ -34,7 +34,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"91.1K\", \"totalSubmission\": \"165.6K\", \"totalAcceptedRaw\": 91126, \"totalSubmissionRaw\": 165556, \"acRate\": \"55.0%\"}",
"stats": "{\"totalAccepted\": \"94.3K\", \"totalSubmission\": \"171.5K\", \"totalAcceptedRaw\": 94273, \"totalSubmissionRaw\": 171488, \"acRate\": \"55.0%\"}",
"hints": [
"First define a function f(x) that counts the number of missing elements until x.",
"Then use binary search with the given function f(x) to find the kth missing element."