什么是链表:
链表是一个对象的有序集合。
对象,即我们定义的节点Node,每node中包含有数据Data和指针Next,串联在一起即是链表
class Node:
def __init__(self,data=None):
self.data = data
self.next = None
def __repr__(self):
return self.data
class LinkedList:
def __init__(self):
self.head = None
def __repr__(self):
node = self.head
nodes = []
while node is not None:
nodes.append(node.data)
node=node.next
nodes.append('None')
return '->'.join(nodes)
if __name__ =='__main__':
ll = LinkedList()
print(ll)# None
a = Node('A')
ll.head = a
b =Node('B')
a.next = b
c =Node('C')
b.next =c
d=Node('D')
c.next = d
print(ll) # A->B->C->D->None