1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 07:21:40 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee
This commit is contained in:
2022-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions

View File

@@ -12,7 +12,7 @@
"translatedContent": "<p>请判断原始的序列&nbsp;<code>org</code>&nbsp;是否可以从序列集&nbsp;<code>seqs</code>&nbsp;中唯一地 <strong>重建&nbsp;</strong>。</p>\n\n<p>序列&nbsp;<code>org</code>&nbsp;是 1 到 n 整数的排列,其中 1 &le; n &le; 10<sup>4</sup>。<strong>重建&nbsp;</strong>是指在序列集 <code>seqs</code> 中构建最短的公共超序列,即&nbsp;&nbsp;<code>seqs</code>&nbsp;中的任意序列都是该最短序列的子序列。</p>\n\n<p>&nbsp;</p>\n\n<p><strong>示例 1</strong></p>\n\n<pre>\n<strong>输入: </strong>org = [1,2,3], seqs = [[1,2],[1,3]]\n<strong>输出: </strong>false\n<strong>解释:</strong>[1,2,3] 不是可以被重建的唯一的序列,因为 [1,3,2] 也是一个合法的序列。\n</pre>\n\n<p><strong>示例 2</strong></p>\n\n<pre>\n<strong>输入: </strong>org = [1,2,3], seqs = [[1,2]]\n<strong>输出: </strong>false\n<strong>解释:</strong>可以重建的序列只有 [1,2]。\n</pre>\n\n<p><strong>示例 3</strong></p>\n\n<pre>\n<strong>输入: </strong>org = [1,2,3], seqs = [[1,2],[1,3],[2,3]]\n<strong>输出: </strong>true\n<strong>解释:</strong>序列 [1,2], [1,3] 和 [2,3] 可以被唯一地重建为原始的序列 [1,2,3]。\n</pre>\n\n<p><strong>示例 4</strong></p>\n\n<pre>\n<strong>输入: </strong>org = [4,1,5,2,6,3], seqs = [[5,2,6,3],[4,1,5,2]]\n<strong>输出: </strong>true\n</pre>\n\n<p>&nbsp;</p>\n\n<p><strong>提示:</strong></p>\n\n<ul>\n\t<li><code>1 &lt;= n &lt;= 10<sup>4</sup></code></li>\n\t<li><code>org</code> 是数字 <code>1</code> 到 <code>n</code> 的一个排列</li>\n\t<li><code>1 &lt;= segs[i].length &lt;= 10<sup>5</sup></code></li>\n\t<li><code>seqs[i][j]</code> 是 <code>32</code> 位有符号整数</li>\n</ul>\n\n<p>&nbsp;</p>\n\n<p>注意:本题与主站 444&nbsp;题相同:<a href=\"https://leetcode-cn.com/problems/sequence-reconstruction/\">https://leetcode-cn.com/problems/sequence-reconstruction/</a></p>\n",
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 14,
"likes": 17,
"dislikes": 0,
"isLiked": null,
"similarQuestions": "[]",
@@ -156,7 +156,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"2.9K\", \"totalSubmission\": \"9.7K\", \"totalAcceptedRaw\": 2948, \"totalSubmissionRaw\": 9683, \"acRate\": \"30.4%\"}",
"stats": "{\"totalAccepted\": \"3.6K\", \"totalSubmission\": \"11.7K\", \"totalAcceptedRaw\": 3570, \"totalSubmissionRaw\": 11729, \"acRate\": \"30.4%\"}",
"hints": [],
"solution": null,
"status": null,