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

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 1568,
"dislikes": 82,
"likes": 1581,
"dislikes": 83,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[1,2,3,4]\n[4,1,5,20,3]\n[2,10,8]",
@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"42.5K\", \"totalSubmission\": \"80.9K\", \"totalAcceptedRaw\": 42506, \"totalSubmissionRaw\": 80876, \"acRate\": \"52.6%\"}",
"stats": "{\"totalAccepted\": \"42.9K\", \"totalSubmission\": \"81.7K\", \"totalAcceptedRaw\": 42872, \"totalSubmissionRaw\": 81661, \"acRate\": \"52.5%\"}",
"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.",