|
| 1 | +<h2><ahref="https://leetcode.com/problems/remove-nth-node-from-end-of-list/">19. Remove Nth Node From End of List</a></h2><h3>Medium</h3><hr><p>Given the <code>head</code> of a linked list, remove the <code>n<sup>th</sup></code> node from the end of the list and return its head.</p> |
| 2 | + |
| 3 | +<p> </p> |
| 4 | +<p><strongclass="example">Example 1:</strong></p> |
| 5 | +<imgalt=""src="https://assets.leetcode.com/uploads/2020/10/03/remove_ex1.jpg"style="width:542px;height:222px;" /> |
| 6 | +<pre> |
| 7 | +<strong>Input:</strong> head = [1,2,3,4,5], n = 2 |
| 8 | +<strong>Output:</strong> [1,2,3,5] |
| 9 | +</pre> |
| 10 | + |
| 11 | +<p><strongclass="example">Example 2:</strong></p> |
| 12 | + |
| 13 | +<pre> |
| 14 | +<strong>Input:</strong> head = [1], n = 1 |
| 15 | +<strong>Output:</strong> [] |
| 16 | +</pre> |
| 17 | + |
| 18 | +<p><strongclass="example">Example 3:</strong></p> |
| 19 | + |
| 20 | +<pre> |
| 21 | +<strong>Input:</strong> head = [1,2], n = 1 |
| 22 | +<strong>Output:</strong> [1] |
| 23 | +</pre> |
| 24 | + |
| 25 | +<p> </p> |
| 26 | +<p><strong>Constraints:</strong></p> |
| 27 | + |
| 28 | +<ul> |
| 29 | +<li>The number of nodes in the list is <code>sz</code>.</li> |
| 30 | +<li><code>1 <= sz <= 30</code></li> |
| 31 | +<li><code>0 <= Node.val <= 100</code></li> |
| 32 | +<li><code>1 <= n <= sz</code></li> |
| 33 | +</ul> |
| 34 | + |
| 35 | +<p> </p> |
| 36 | +<p><strong>Follow up:</strong> Could you do this in one pass?</p> |