19.删除链表的倒数第N个节点
题目描述
Leetcode:https://leetcode-cn.com/problems/remove-nth-node-from-end-of-list/
给定一个链表,删除链表的倒数第 n 个节点,并且返回链表的头结点。
示例:
给定一个链表: 1->2->3->4->5, 和 n = 2.
当删除了倒数第二个节点后,链表变为 1->2->3->5.
说明:
给定的 n 保证是有效的。
进阶:
你能尝试使用一趟扫描实现吗?
解题思路
首先添加哑结点(dummy)作为辅助,简化列表只有一个结点或删除头结点的极端情况。然后使用双指针(first, second)一次遍历,first先移动n + 1步,second再从列表开头和first一起移动,两个指针被n个结点分割。first到达列表最后一个结点,重新链接第二个结点(second)的下一结点即second.next = second.next.next。
java代码
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution {
public ListNode removeNthFromEnd(ListNode head, int n) {
ListNode dummy = new ListNode(0);
dummy.next = head;
ListNode first = dummy;
ListNode second = dummy;
for(int i = 1; i <= n + 1; i++){
first = first.next;
}
while(first != null){
first = first.next;
second = second.next;
}
second.next = second.next.next;
return dummy.next;
}
}
python代码
# Definition for singly-linked list.
# class ListNode:
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution:
def removeNthFromEnd(self, head: ListNode, n: int) -> ListNode:
dummy = ListNode(0)
dummy.next = head
first, second = dummy, dummy
n += 1
while n:
first = first.next
n -= 1
while first != None:
first = first.next
second = second.next
second.next = second.next.next
return dummy.next