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

update

Browse Source
This commit is contained in:
小墨
2022-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"6.2K\", \"totalSubmission\": \"16.5K\", \"totalAcceptedRaw\": 6207, \"totalSubmissionRaw\": 16542, \"acRate\": \"37.5%\"}",
"stats": "{\"totalAccepted\": \"6.2K\", \"totalSubmission\": \"16.6K\", \"totalAcceptedRaw\": 6215, \"totalSubmissionRaw\": 16559, \"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?",