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

存量题库数据更新

Browse Source
This commit is contained in:
小墨
2023-12-09 18:42:21 +08:00
parent a788808cd7
commit c198538f10
10843 changed files with 288489 additions and 248355 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
leetcode-cn/problem (English)/最长数对链(English) [maximum-length-of-pair-chain].html
View File

@@ -7,7 +7,7 @@
<p>You do not need to use up all the given intervals. You can select pairs in any order.</p>
<p>&nbsp;</p>
<p><strong>Example 1:</strong></p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong> pairs = [[1,2],[2,3],[3,4]]
@@ -15,7 +15,7 @@
<strong>Explanation:</strong> The longest chain is [1,2] -&gt; [3,4].
</pre>
<p><strong>Example 2:</strong></p>
<p><strong class="example">Example 2:</strong></p>
<pre>
<strong>Input:</strong> pairs = [[1,2],[7,8],[4,5]]