coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-07 08:21: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-cn/originData/[no content]minimize-rounding-error-to-meet-target.json
View File

@@ -12,7 +12,7 @@
"translatedContent": null,
"isPaidOnly": true,
"difficulty": "Medium",
"likes": 32,
"likes": 33,
"dislikes": 0,
"isLiked": null,
"similarQuestions": "[]",
@@ -46,7 +46,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"1.5K\", \"totalSubmission\": \"4.3K\", \"totalAcceptedRaw\": 1494, \"totalSubmissionRaw\": 4279, \"acRate\": \"34.9%\"}",
"stats": "{\"totalAccepted\": \"1.5K\", \"totalSubmission\": \"4.4K\", \"totalAcceptedRaw\": 1539, \"totalSubmissionRaw\": 4389, \"acRate\": \"35.1%\"}",
"hints": [
"If we have integer values in the array then we just need to subtract the target those integer values, so we reduced the problem.",
"Similarly if we have non integer values we have two options to put them flor(value) or ceil(value) = floor(value) + 1, so the idea is to just subtract floor(value).",