给定一个链表,删除链表的倒数第 n 个节点,并且返回链表的头结点。
链接 https://leetcode-cn.com/problems/remove-nth-node-from-end-of-list/
凑数吧
class Solution:
def removeNthFromEnd(self, head: ListNode, n: int) -> ListNode:
lists = []
arrow = head
while arrow:
lists.append(arrow)
arrow = arrow.next
print()
if -n-1>=-len(lists):
lists[-n-1].next = lists[-n].next
else:
return head.next
return head
原文地址:https://www.cnblogs.com/Lzqayx/p/12142215.html
时间: 2024-11-05 16:42:31