给你一个链表,删除链表的倒数第 n
个结点,并且返回链表的头结点。
# 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: Optional[ListNode], n: int) -> Optional[ListNode]:
dummyhead = ListNode()
dummyhead.next = head
fast = dummyhead
slow = dummyhead
n += 1
while fast != None and n:
fast = fast.next
n -= 1
while fast != None:
fast = fast.next
slow = slow.next
slow.next = slow.next.next
return dummyhead.next