题目:
给你一个链表,删除链表的倒数第 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]
代码:
# Definition for singly-linked list.
# class ListNode:
# def __init__(self, val=0, next=None):
# self.val = val
# self.next = next
class Solution:
def removeNthFromEnd(self, head: ListNode, n: int) -> ListNode:
#添加新的头,是为了防止链表只有一个结点时,出现null = null.next的现象
new_ = ListNode(2,head)
tmp = new_
stack = []
while tmp:
stack.append(tmp)
tmp = tmp.next
for _ in range(n):
stack.pop()
stack[-1].next = stack[-1].next.next
return new_.next