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-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
leetcode/originData/reducing-dishes.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 897,
"likes": 898,
"dislikes": 135,
"isLiked": null,
"similarQuestions": "[]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"35.4K\", \"totalSubmission\": \"48.7K\", \"totalAcceptedRaw\": 35374, \"totalSubmissionRaw\": 48747, \"acRate\": \"72.6%\"}",
"stats": "{\"totalAccepted\": \"35.4K\", \"totalSubmission\": \"48.9K\", \"totalAcceptedRaw\": 35446, \"totalSubmissionRaw\": 48884, \"acRate\": \"72.5%\"}",
"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."