mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 02:58:13 +08:00
33 lines
949 B
HTML
33 lines
949 B
HTML
|
<p>给定一个未排序的整数数组<meta charset="UTF-8" /> <code>nums</code> ， <em>返回最长递增子序列的个数</em> 。</p>
|
|||
|
|
|
|||
|
|
<p><strong>注意</strong> 这个数列必须是 <strong>严格</strong> 递增的。</p>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>示例 1:</strong></p>
|
|||
|
|
|
|||
|
|
<pre>
|
|||
|
|
<strong>输入:</strong> [1,3,5,4,7]
|
|||
|
|
<strong>输出:</strong> 2
|
|||
|
|
<strong>解释:</strong> 有两个最长递增子序列，分别是 [1, 3, 4, 7] 和[1, 3, 5, 7]。
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p><strong>示例 2:</strong></p>
|
|||
|
|
|
|||
|
|
<pre>
|
|||
|
|
<strong>输入:</strong> [2,2,2,2,2]
|
|||
|
|
<strong>输出:</strong> 5
|
|||
|
|
<strong>解释:</strong> 最长递增子序列的长度是1，并且存在5个子序列的长度为1，因此输出5。
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>提示:</strong> </p>
|
|||
|
|
|
|||
|
|
<p><meta charset="UTF-8" /></p>
|
|||
|
|
|
|||
|
|
<ul>
|
|||
|
|
<li><code>1 <= nums.length <= 2000</code></li>
|
|||
|
|
<li><code>-10<sup>6</sup> <= nums[i] <= 10<sup>6</sup></code></li>
|
|||
|
|
</ul>
|