首页 > 其他 > 详细

leetcode-19-删除链表的倒数第N个节点

时间:2019-07-10 09:35:37      阅读:109      评论:0      收藏:0      [点我收藏+]

题目描述:

技术分享图片

 

方法一:快慢指针

class Solution:
    def removeNthFromEnd(self, head: ListNode, n: int) -> ListNode:
        if not head:
            return
        dummy = ListNode(0)
        dummy.next = head
        fast = dummy
        while n:
            fast = fast.next
            n -= 1
        slow = dummy
        while fast and fast.next:
            fast = fast.next
            slow = slow.next
        slow.next = slow.next.next
        return dummy.next

 方法二:

class Solution:
    def removeNthFromEnd(self, head: ListNode, n: int) -> ListNode:
        p_list = []
        p = head
        while p:
            p_list.append(p.val)
            p = p.next
        del p_list[-n]
        return p_list

 

leetcode-19-删除链表的倒数第N个节点

原文:https://www.cnblogs.com/oldby/p/11161771.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!