coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 23:11: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

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

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 898,
"dislikes": 135,
"likes": 934,
"dislikes": 138,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[-1,-8,0,5,-7]\n[4,3,2]\n[-1,-4,-5]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"35.4K\", \"totalSubmission\": \"48.9K\", \"totalAcceptedRaw\": 35446, \"totalSubmissionRaw\": 48884, \"acRate\": \"72.5%\"}",
"stats": "{\"totalAccepted\": \"36.5K\", \"totalSubmission\": \"50.4K\", \"totalAcceptedRaw\": 36482, \"totalSubmissionRaw\": 50378, \"acRate\": \"72.4%\"}",
"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."