mirror of
https://github.com/halfrost/LeetCode-Go.git
synced 2025-07-05 16:36:41 +08:00
52 lines
1.2 KiB
Markdown
52 lines
1.2 KiB
Markdown
# [19. Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list/)
|
||
|
||
## 题目
|
||
|
||
Given the `head` of a linked list, remove the `nth` node from the end of the list and return its head.
|
||
|
||
**Follow up:** Could you do this in one pass?
|
||
|
||
**Example 1:**
|
||
|
||
|
||
|
||
```
|
||
Input: head = [1,2,3,4,5], n = 2
|
||
Output: [1,2,3,5]
|
||
|
||
```
|
||
|
||
**Example 2:**
|
||
|
||
```
|
||
Input: head = [1], n = 1
|
||
Output: []
|
||
|
||
```
|
||
|
||
**Example 3:**
|
||
|
||
```
|
||
Input: head = [1,2], n = 1
|
||
Output: [1]
|
||
|
||
```
|
||
|
||
**Constraints:**
|
||
|
||
- The number of nodes in the list is `sz`.
|
||
- `1 <= sz <= 30`
|
||
- `0 <= Node.val <= 100`
|
||
- `1 <= n <= sz`
|
||
|
||
|
||
## 题目大意
|
||
|
||
删除链表中倒数第 n 个结点。
|
||
|
||
## 解题思路
|
||
|
||
这道题比较简单，先循环一次拿到链表的总长度，然后循环到要删除的结点的前一个结点开始删除操作。需要注意的一个特例是，有可能要删除头结点，要单独处理。
|
||
|
||
这道题有一种特别简单的解法。设置 2 个指针，一个指针距离前一个指针 n 个距离。同时移动 2 个指针，2 个指针都移动相同的距离。当一个指针移动到了终点，那么前一个指针就是倒数第 n 个节点了。
|