题目地址
给你一个链表,删除链表的倒数第 n 个结点,并且返回链表的头结点。
示例 1:
输入:head = [1,2,3,4,5], n = 2
输出:[1,2,3,5]
示例 2:
输入:head = [1], n = 1
输出:[]
示例 3:
输入:head = [1,2], n = 1
输出:[1]
提示:
链表中结点的数目为 sz
1 <= sz <= 30
0 <= Node.val <= 100
1 <= n <= sz
我认为需要头结点
这道题是一道双指针的题,那么也就是说,pre结点始终与rear结点保持n个距离。直到rear结点的next是None之后,因为只是删除倒数第n个结点,所以此时pre.next = pre.next.next
代码实现:
# Definition for singly-linked list.
# class ListNode(object):
# def __init__(self, val=0, next=None):
# self.val = val
# self.next = next
class Solution(object):
def removeNthFromEnd(self, head, n):
"""
:type head: ListNode
:type n: int
:rtype: ListNode
"""
res = ListNode(next = head)#创建一个虚拟的头节点
print('1:',res)
rear = pre = res
count = 0
while rear.next != None and count != n:#这和是为了去寻找wei指针的位置
rear = rear.next
count += 1
while rear.next != None:#使得尾指针指到末尾位置
rear = rear.next
pre = pre.next
#进行删除操作
pre.next = pre.next.next
print('2:',res)
return res.next
这个解答最妙的一点在于,用了head之前的节点作为起点,避免了删除正数第一个节点的问题
print过程:
1: ListNode{val: 0, next: ListNode{val: 1, next: ListNode{val: 2, next: ListNode{val: 3, next: ListNode{val: 4, next: ListNode{val: 5, next: None}}}}}}
2: ListNode{val: 0, next: ListNode{val: 1, next: ListNode{val: 2, next: ListNode{val: 3, next: ListNode{val: 5, next: None}}}}}