coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 06:51:41 +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/minimum-total-space-wasted-with-k-resizing-operations.json
View File

@@ -12,7 +12,7 @@
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 373,
"dislikes": 31,
"dislikes": 32,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[10,20]\n0\n[10,20,30]\n1\n[10,20,15,30,20]\n2",
@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"5.1K\", \"totalSubmission\": \"12.1K\", \"totalAcceptedRaw\": 5056, \"totalSubmissionRaw\": 12098, \"acRate\": \"41.8%\"}",
"stats": "{\"totalAccepted\": \"5.1K\", \"totalSubmission\": \"12.1K\", \"totalAcceptedRaw\": 5068, \"totalSubmissionRaw\": 12114, \"acRate\": \"41.8%\"}",
"hints": [
"Given a range, how can you find the minimum waste if you can't perform any resize operations?",
"Can we build our solution using dynamic programming using the current index and the number of resizing operations performed as the states?"