python数据结构之链表

''''
链表的实现，单向链表
'''

'''建立节点'''
class jd:
    def __init__(self,data):
        self.data = data
        self.next = None

'''实现链表的关系'''
class Linklist:
    def __init__(self,jd2):
        self.head = jd2
        self.head.next = None
        self.tail = self.head

    def add(self,jd2):
        self.tail.next = jd2
        self.tail = self.tail.next

    def view(self):
        jd2 = self.head
        linkstr = ""
        while jd2 is not None:
            if jd2.next is not None:
                linkstr = linkstr+str(jd2.data)+"-->"
            else:
                linkstr+=str(jd2.data)
            jd2 = jd2.next
        print(linkstr)

if __name__ == "__main__":
    jd1 = jd(67)
    jd2 = jd(78)
    jd3 = jd(46)
    jd4 = jd(19)

    '''节点1（jd1）作为表头'''
    lb = Linklist(jd1)

    '''jd2作为第二个节点'''
    lb.add(jd2)
    lb.add(jd3)
    lb.add(jd4)

    '''遍历这个链表'''
    lb.view()