coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-11 18:31:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

更新国内版力扣题目描述变更

Browse Source
This commit is contained in:
小墨
2022-05-02 23:42:43 +08:00
parent 74598d1cf8
commit 7ea03594b3
198 changed files with 11378 additions and 11118 deletions
Download Patch File Download Diff File Expand all files Collapse all files

46
leetcode-cn/problem (English)/堆箱子(English) [pile-box-lcci].html
View File

@@ -1,23 +1,23 @@
<p>You have a stack of n boxes, with widths wi, depths di, and heights hi. 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 compute the height of the tallest possible stack. The height of a stack is the sum of the heights of each box.</p>
<p>The input use <code>[wi, di, hi]</code>&nbsp;to represents each box.</p>
<p><strong>Example1:</strong></p>
<pre>
<strong> Input</strong>: box = [[1, 1, 1], [2, 2, 2], [3, 3, 3]]
<strong> Output</strong>: 6
</pre>
<p><strong>Example2:</strong></p>
<pre>
<strong> Input</strong>: box = [[1, 1, 1], [2, 3, 4], [2, 6, 7], [3, 4, 5]]
<strong> Output</strong>: 10
</pre>
<p><strong>Note:</strong></p>
<ol>
<li><code>box.length &lt;= 3000</code></li>
</ol>
<p>You have a stack of n boxes, with widths wi, depths di, and heights hi. 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 compute the height of the tallest possible stack. The height of a stack is the sum of the heights of each box.</p>
<p>The input use <code>[wi, di, hi]</code>&nbsp;to represents each box.</p>
<p><strong>Example1:</strong></p>
<pre>
<strong> Input</strong>: box = [[1, 1, 1], [2, 2, 2], [3, 3, 3]]
<strong> Output</strong>: 6
</pre>
<p><strong>Example2:</strong></p>