mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-26 02:00:27 +08:00
15 lines
788 B
HTML
15 lines
788 B
HTML
|
<p>A circus is designing a tower routine consisting of people standing atop one anoth­er's shoulders. For practical and aesthetic reasons, each person must be both shorter and lighter than the person below him or her. Given the heights and weights of each person in the circus, write a method to compute the largest possible number of people in such a tower.</p>
|
||
|
|
|
||
|
|
<p><strong>Example: </strong></p>
|
||
|
|
|
||
|
|
<pre>
|
||
|
|
<strong>Input: </strong>height = [65,70,56,75,60,68] weight = [100,150,90,190,95,110]
|
||
|
|
<strong>Output: </strong>6
|
||
|
|
<strong>Explanation: </strong>The longest tower is length 6 and includes from top to bottom: (56,90), (60,95), (65,100), (68,110), (70,150), (75,190)</pre>
|
||
|
|
|
||
|
|
<p>Note:</p>
|
||
|
|
|
||
|
|
<ul>
|
||
|
|
<li><code>height.length == weight.length <= 10000</code></li>
|
||
|
|
</ul>
|