coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-08 00:41:42 +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/reducing-dishes.json
View File

@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"129.7K\", \"totalSubmission\": \"169.8K\", \"totalAcceptedRaw\": 129674, \"totalSubmissionRaw\": 169850, \"acRate\": \"76.3%\"}",
"stats": "{\"totalAccepted\": \"129.7K\", \"totalSubmission\": \"169.9K\", \"totalAcceptedRaw\": 129695, \"totalSubmissionRaw\": 169877, \"acRate\": \"76.3%\"}",
"hints": [
"Use dynamic programming to find the optimal solution by saving the previous best like-time coefficient and its corresponding element sum.",
"If adding the current element to the previous best like-time coefficient and its corresponding element sum would increase the best like-time coefficient, then go ahead and add it. Otherwise, keep the previous best like-time coefficient."