题目:
解题思路:
- 与其说删除链表的倒数第n个节点,不如说删除链表的第k-n个节点的下一个节点,k为链表长度
- 1 2 3 4 5 6 - 倒数第二个节点5,正好就是正数第6-2个节点的下一个
- 走到第k-n个节点,正好k-n.next = k-n.next.next就可以了
# def __init__(self, x):
# self.val = x
# self.next = None
#
# 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可
#
#
# @param head ListNode类
# @param n int整型
# @return ListNode类
#
class Solution:
def removeNthFromEnd(self , head: ListNode, n: int) -> ListNode:
# write code here
count = 0
pos = 0
res = ListNode(0)
pre = res
pre.next = head
q = head
while q:
count += 1
q = q.next
print(count)
while pos < count - n:
pre = pre.next
pos += 1
r = pre.next
pre.next = r.next
return res.next