登录
  • #刷题
  • #careercup

【第三轮】8.3-8.9 CareerCup 9.10

林微熙
1528
5
9.10 You have a stack of n boxes, with widths w1, heights h1 and depths d1. The boxes cannot be rotated and can only be stacked on top of one another if each box in the stack is strictly larger than the box above it in width, height, and depth. Implement a method to build the tallest stack possible, where the height of a stack is the sum of the heights of each box









回复解法可以按照以下格式来

[indent][indent]【解题思路】

【时间复杂度】

【空间复杂度】

【gist link】

---------------OPTional,如果觉得test case比较好,欢迎写出来分享----------------------

【test case】[/indent]
[/indent]
5条回复
热度排序

发表回复