coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-12 19:01:47 +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

6
leetcode-cn/problem (English)/最长公共子路径(English) [longest-common-subpath].html
View File

@@ -7,7 +7,7 @@
<p>A <strong>subpath</strong> of a path is a contiguous sequence of cities within that path.</p>
<p>&nbsp;</p>
<p><strong>Example 1:</strong></p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong> n = 5, paths = [[0,1,<u>2,3</u>,4],
@@ -17,7 +17,7 @@
<strong>Explanation:</strong> The longest common subpath is [2,3].
</pre>
<p><strong>Example 2:</strong></p>
<p><strong class="example">Example 2:</strong></p>
<pre>
<strong>Input:</strong> n = 3, paths = [[0],[1],[2]]
@@ -25,7 +25,7 @@
<strong>Explanation:</strong> There is no common subpath shared by the three paths.
</pre>
<p><strong>Example 3:</strong></p>
<p><strong class="example">Example 3:</strong></p>
<pre>
<strong>Input:</strong> n = 5, paths = [[<u>0</u>,1,2,3,4],