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-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/maximum-height-by-stacking-cuboids.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 461,
"dislikes": 15,
"likes": 482,
"dislikes": 16,
"isLiked": null,
"similarQuestions": "[{\"title\": \"The Number of Weak Characters in the Game\", \"titleSlug\": \"the-number-of-weak-characters-in-the-game\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
"exampleTestcases": "[[50,45,20],[95,37,53],[45,23,12]]\n[[38,25,45],[76,35,3]]\n[[7,11,17],[7,17,11],[11,7,17],[11,17,7],[17,7,11],[17,11,7]]",
@@ -131,7 +131,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"10.5K\", \"totalSubmission\": \"19.6K\", \"totalAcceptedRaw\": 10508, \"totalSubmissionRaw\": 19647, \"acRate\": \"53.5%\"}",
"stats": "{\"totalAccepted\": \"10.8K\", \"totalSubmission\": \"20.2K\", \"totalAcceptedRaw\": 10848, \"totalSubmissionRaw\": 20242, \"acRate\": \"53.6%\"}",
"hints": [
"Does the dynamic programming sound like the right algorithm after sorting?",
"Let's say box1 can be placed on top of box2. No matter what orientation box2 is in, we can rotate box1 so that it can be placed on top. Why don't we orient everything such that height is the biggest?"