mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-10 18:48:13 +08:00
11 lines
476 B
HTML
11 lines
476 B
HTML
<p>Implement an algorithm to delete a node in the middle (i.e., any node but the first and last node, not necessarily the exact middle) of a singly linked list, given only access to that node.</p>
|
|
|
|
|
|
|
|
<p> </p>
|
|
|
|
|
|
|
|
<p><strong>Example: </strong></p>
|
|
|
|
|
|
|
|
<pre>
|
|
|
|
<strong>Input: </strong>the node c from the linked list a->b->c->d->e->f
|
|
|
|
<strong>Output: </strong>nothing is returned, but the new linked list looks like a->b->d->e->f
|
|
|
|
</pre>
|
|
|