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-03-29 16:56:27 +08:00
parent e730aa6794
commit ad15da05aa
2517 changed files with 7358 additions and 7332 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode-cn/originData/[no content]minimize-rounding-error-to-meet-target.json
View File

@@ -46,7 +46,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"1.5K\", \"totalSubmission\": \"4.3K\", \"totalAcceptedRaw\": 1491, \"totalSubmissionRaw\": 4269, \"acRate\": \"34.9%\"}",
"stats": "{\"totalAccepted\": \"1.5K\", \"totalSubmission\": \"4.3K\", \"totalAcceptedRaw\": 1494, \"totalSubmissionRaw\": 4279, \"acRate\": \"34.9%\"}",
"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).",