coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-06 16:01: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

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

@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"4.3K\", \"totalSubmission\": \"10.1K\", \"totalAcceptedRaw\": 4289, \"totalSubmissionRaw\": 10091, \"acRate\": \"42.5%\"}",
"stats": "{\"totalAccepted\": \"4.3K\", \"totalSubmission\": \"10.1K\", \"totalAcceptedRaw\": 4290, \"totalSubmissionRaw\": 10093, \"acRate\": \"42.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?",