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:
小墨
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/originData/minimize-deviation-in-array.json
View File

@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"91.1K\", \"totalSubmission\": \"167.8K\", \"totalAcceptedRaw\": 91079, \"totalSubmissionRaw\": 167810, \"acRate\": \"54.3%\"}",
"stats": "{\"totalAccepted\": \"91.1K\", \"totalSubmission\": \"167.8K\", \"totalAcceptedRaw\": 91083, \"totalSubmissionRaw\": 167819, \"acRate\": \"54.3%\"}",
"hints": [
"Assume you start with the minimum possible value for each number so you can only multiply a number by 2 till it reaches its maximum possible value.",
"If there is a better solution than the current one, then it must have either its maximum value less than the current maximum value, or the minimum value larger than the current minimum value.",