coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 23:41:41 +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/maximum-height-by-stacking-cuboids.json
View File

@@ -131,7 +131,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"23.5K\", \"totalSubmission\": \"41.9K\", \"totalAcceptedRaw\": 23481, \"totalSubmissionRaw\": 41895, \"acRate\": \"56.0%\"}",
"stats": "{\"totalAccepted\": \"23.5K\", \"totalSubmission\": \"41.9K\", \"totalAcceptedRaw\": 23482, \"totalSubmissionRaw\": 41899, \"acRate\": \"56.0%\"}",
"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?"