leetcode-problemset/leetcode-cn/problem (English)/删除中间节点(English) [delete-middle-node-lcci].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>&nbsp;</p>

<p><strong>Example: </strong></p>

<pre>
<strong>Input: </strong>the node c from the linked list a-&gt;b-&gt;c-&gt;d-&gt;e-&gt;f
<strong>Output: </strong>nothing is returned, but the new linked list looks like a-&gt;b-&gt;d-&gt;e-&gt;f
</pre>
update 2022-03-29 12:43:11 +08:00			`<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>`