LeetCode 刷题记录: 19. Remove Nth Node From End of List [Python]

原题

https://leetcode.com/problems/remove-nth-node-from-end-of-list/

Given a linked list, remove the n-th node from the end of list and return its head.

Follow up:

Could you do this in one pass?

思路

使用两个指针fast以及slow，fast先出发，slow相隔n位再出发。当fast走到尽头时slow跳过下一指针即可。

代码

# 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:
        slow=fast=self
        self.next=head
        while fast.next:
            if n:
                n-=1
            else:
                slow=slow.next
            fast=fast.next
        slow.next=slow.next.next
        return self.next

# LeetCode, LinkedList

支付宝

微信

Paypal Buy me a coffee

LeetCode 刷题记录: 19. Remove Nth Node From End of List [Python]

原题

思路

代码

喜欢这篇文章？打赏一下作者吧

评论

分类

标签

最新文章

归档

最新文章

归档

Your browser is out-of-date!