python使用插入法实现链表反转

# encoding=utf-8


class LNode(object):
    def __init__(self, x):
        self.data = x
        self.next = None


def reverse(head):
    if head is None or head.next is None:
        return
    cur = None
    next = None
    cur = head.next.next
    head.next.next = None
    while cur:
        next = cur.next
        cur.next = head.next
        head.next = cur
        cur = next


if __name__ == "__main__":
    i = 1
    head = LNode(i)
    head.next = None
    tmp = None
    cur = head
    while i < 8:
        tmp = LNode(i)
        tmp.next = None
        cur.next = tmp
        cur = tmp
        i += 1
    print("----------------before reverse----------------")
    cur = head.next
    while cur:
        print(cur.data)
        cur = cur.next

    print("----------------after reverse----------------")
    reverse(head)
    cur = head.next
    while cur:
        print(cur.data)
        cur = cur.next

输出

----------------before reverse----------------
1
2
3
4
5
6
7
----------------after reverse----------------
7
6
5
4
3
2
1

转载于:https://www.cnblogs.com/byron0918/p/10204783.html

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值