python 模拟链表

class Node():
    def __init__(self,value,next=None):
        self.value = value
        self.next  = next
        
def CreateList(n):
    if n<=0:
        return False
    if n == 1:
        return Node(1)
    else:
        root = Node(1)
        tmp  = root
        for i in range(2,n+1):
            tmp.next = Node(i)
            tmp      = tmp.next
    return root

def printList(head):
    p = head
    while p!=None:
        print p.value
        p = p.next

def listLen(head):
    cnt = 0
    p   = head
    while(p!=None):
        p = p.next
        cnt += 1
    return cnt

def insert(head,n):
    if n<1 or n>listLen(head):
        return
    p = head
    for i in range(1,n-1):
        p = p.next
    a = raw_input("Enter a value:")
    t = Node(value = a)
    t.next = p .next
    p.next = t
    return head
    
def dellist(head,n):
    if n<1 or n>listLen(head):
        return head
    elif n is 1:
        head = head.next
    else:
        p = head
        for i in range(1,n-1):
            p = p.next
        q = p.next
        p.next = q.next
    return head

def mergeTwoLists(l1, l2):    
    if l1 is None:
        return l2
    if l2 is None:
        return l1
    pHead = Node(0)
    if l1.value <l2.value:
        pHead = l1
        pHead.next = mergeTwoLists(l1.next,l2)
    else:
        pHead = l2
        pHead.next = mergeTwoLists(l1,l2.next)
    return pHead    

if __name__ == "__main__":
    print "Create a linklist"
    head1 = CreateList(7)
    head2 = CreateList(8)
    head = mergeTwoLists(head1,head2)
    printList(head)
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
        

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

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值