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:
小墨
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

4
leetcode/originData/recover-the-original-array.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 214,
"likes": 220,
"dislikes": 26,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Find Array Given Subset Sums\", \"titleSlug\": \"find-array-given-subset-sums\", \"difficulty\": \"Hard\", \"translatedTitle\": null}, {\"title\": \"Find Original Array From Doubled Array\", \"titleSlug\": \"find-original-array-from-doubled-array\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"6.2K\", \"totalSubmission\": \"16.6K\", \"totalAcceptedRaw\": 6215, \"totalSubmissionRaw\": 16559, \"acRate\": \"37.5%\"}",
"stats": "{\"totalAccepted\": \"6.4K\", \"totalSubmission\": \"17K\", \"totalAcceptedRaw\": 6384, \"totalSubmissionRaw\": 17037, \"acRate\": \"37.5%\"}",
"hints": [
"If we fix the value of k, how can we check if an original array exists for the fixed k?",
"The smallest value of nums is obtained by subtracting k from the smallest value of the original array. How can we use this to reduce the search space for finding a valid k?",