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

add leetcode problem-cn part2

Browse Source
This commit is contained in:
小墨
2022-03-27 20:38:29 +08:00
parent 5a4fa6db12
commit 0fc7f4b734
1617 changed files with 134637 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

14
算法题（国内版）/problem (English)/马戏团人塔(English) [circus-tower-lcci].html Normal file
View File

@@ -0,0 +1,14 @@
<p>A circus is designing a tower routine consisting of people standing atop one anoth&shy;er&#39;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 &lt;= 10000</code></li>
</ul>