PIQ18: Delete middle node of a linked list

11 篇文章 0 订阅

Problem statement
Given a pointer to the middle node of the linked list, delete that node.

Solution

# Definition for singly-linked list.
class ListNode(object):
    def __init__(self, x):
        self.val = x
        self.next = None


def del_mid_node(head, mid):
    temp = mid.next
    mid.val = temp.val
    mid.next = temp.next


if __name__ == "__main__":
    n1 = ListNode(1)
    n2 = ListNode(2)
    n3 = ListNode(3)
    n4 = ListNode(4)
    n5 = ListNode(5)
    head, mid = n1, n3
    n1.next = n2
    n2.next = n3
    n3.next = n4
    n4.next = n5

    del_mid_node(head, mid)

    p = head
    while p:
        print p.val
        p = p.next
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值