python---数据结构---链表合并/逆转

class ListNode(object):
    def __init__(self,data=0,next=None):
        self.data=data
        self.next=next

class LinkList(object):
    def __init__(self):
        self.head=ListNode(None)#头节点
    def Empty(self):#判空
        if self.head.next==None:
            return True
        else:
            return False

    def initwei(self,e):#尾插
        p=self.head
        while p.next:
            p=p.next
        q = ListNode(e)
        p.next=q


    def ni(self):#逆转
        first=self.head.next
        second=first.next
        first.next=None
        self.head.next=None
        while second:
            third=second.next
            second.next=first
            first=second
            second=third
        self.head.next=first



    def prit(self):
        p = self.head
        while p.next != None:
            print(p.next.data)
            p=p.next
        print('\n')


    def mergeTwoLists(self, l1, l2):
            if not l1 and not l2:
                return l1
            elif not l1 and l2:
                return l2
            elif l1 and not l2:
                return l1
            tail1 = l1
            tail2 = l2
            if tail1.data < tail2.data:
                head = tail1
                tail1 = tail1.next
                head.next = None
            else:
                head = tail2
                tail2 = tail2.next
                head.next = None
            tail = head
            while (tail1 and tail2):
                if tail1.data < tail2.data:
                    tail.next = tail1
                    tail1 = tail1.next
                    tail = tail.next
                    tail.next = None
                else:
                    tail.next = tail2
                    tail2 = tail2.next
                    tail = tail.next
                    tail.next = None
            if tail1:
                tail.next = tail1
            elif tail2:
                tail.next = tail2
            return head

if __name__=='__main__':
    mylist_A=LinkList()

    for i in range(1, 6):
      print('input value:')
      n=int(input())
      mylist_A.initwei(n)
    mylist_A.prit()

    print ('after reverse:')
    mylist_A.ni()
    mylist_A.prit()

    mylist_B = LinkList()

    for i in range(1, 6):
        print('input value:')
        n = int(input())
        mylist_B.initwei(n)
    mylist_B.prit()
    print('merge two list')
    mylist_A.mergeTwoLists(mylist_B.head.next,mylist_A.head.next)
    mylist_A.prit()



评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

东箭武

你的鼓励将是我创作的最大动力

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付:¥1
获取中
扫码支付

您的余额不足,请更换扫码支付或充值

打赏作者

实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

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

余额充值