mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 03:33:12 +08:00
51 lines
1.7 KiB
HTML
51 lines
1.7 KiB
HTML
<p>请实现 <code>copyRandomList</code> 函数，复制一个复杂链表。在复杂链表中，每个节点除了有一个 <code>next</code> 指针指向下一个节点，还有一个 <code>random</code> 指针指向链表中的任意节点或者 <code>null</code>。</p>
|
||
|
||
<p> </p>
|
||
|
||
<p><strong>示例 1：</strong></p>
|
||
|
||
<p><img alt="" src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2020/01/09/e1.png"></p>
|
||
|
||
<pre><strong>输入：</strong>head = [[7,null],[13,0],[11,4],[10,2],[1,0]]
|
||
<strong>输出：</strong>[[7,null],[13,0],[11,4],[10,2],[1,0]]
|
||
</pre>
|
||
|
||
<p><strong>示例 2：</strong></p>
|
||
|
||
<p><img alt="" src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2020/01/09/e2.png"></p>
|
||
|
||
<pre><strong>输入：</strong>head = [[1,1],[2,1]]
|
||
<strong>输出：</strong>[[1,1],[2,1]]
|
||
</pre>
|
||
|
||
<p><strong>示例 3：</strong></p>
|
||
|
||
<p><strong><img alt="" src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2020/01/09/e3.png"></strong></p>
|
||
|
||
<pre><strong>输入：</strong>head = [[3,null],[3,0],[3,null]]
|
||
<strong>输出：</strong>[[3,null],[3,0],[3,null]]
|
||
</pre>
|
||
|
||
<p><strong>示例 4：</strong></p>
|
||
|
||
<pre><strong>输入：</strong>head = []
|
||
<strong>输出：</strong>[]
|
||
<strong>解释：</strong>给定的链表为空（空指针），因此返回 null。
|
||
</pre>
|
||
|
||
<p> </p>
|
||
|
||
<p><strong>提示：</strong></p>
|
||
|
||
<ul>
|
||
<li><code>-10000 <= Node.val <= 10000</code></li>
|
||
<li><code>Node.random</code> 为空（null）或指向链表中的节点。</li>
|
||
<li>节点数目不超过 1000 。</li>
|
||
</ul>
|
||
|
||
<p> </p>
|
||
|
||
<p><strong>注意：</strong>本题与主站 138 题相同：<a href="https://leetcode-cn.com/problems/copy-list-with-random-pointer/">https://leetcode-cn.com/problems/copy-list-with-random-pointer/</a></p>
|
||
|
||
<p> </p>
|