# 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:
if not head : return
begin_Node=ListNode(0)
begin_Node.next=head
front_pointer=begin_Node
behind_pointer=begin_Node
while n:
behind_pointer=behind_pointer.next
n-=1
while behind_pointer and behind_pointer.next :
behind_pointer=behind_pointer.next
front_pointer=front_pointer.next
front_pointer.next=front_pointer.next.next
return begin_Node.next
链表的东西在开始接触的时候还是一头雾水啊,开始慢慢的多试试,效仿了题解里面的一种方法,但是在想如果对于长度为1的head,删除掉倒数第一个点,返回的应该是None吧。