单链表的建立
def jldlb(a,n): q=None for i in range(n-1,-1,-1): s=Node(a[i]) s._next=q q=s return s a=[1,2,3,4,5] head=jldlb(a,5) head.disp()
双链表的建立
def jlslb(a,n): s=Node(a[n-1]) q=s for i in range(2,n+1): s=Node(a[n-i]) s._Rnext=q q._Lnext=s q=s return s
单链表的逆序
def addlb(head): p=head q=p._next r=q._next while r!=None: q._next=p p=q q=r r=r._next q._next=p head._next=None return q head=addlb(head) #print() head.disp()