生成随机链表 打印链表

生成随机长度的单向链表

class Node(object):

    def __init__(self, value=None, next=None):
        self.val = value
        self.next = next

    def __repr__(self):
        return "Node:{0.val!s}".format(self)

    def __str__(self):
        next = None
        if self.next:
            next = self.next.val
        return "Node({0.val!s},next:{1})".format(self,next)


def generateLinkedList(maxnum=20):
	import random
	import string
    num = random.randint(0, maxnum)
    if num == 0:
        return None
    head = Node(random.choice(string.ascii_uppercase))
    cur = head
    for i in range(1, num):
        cur.next = Node(random.choice(string.ascii_uppercase))
        cur = cur.next
    return head

生成随机长度的双向链表

class DoubleWayNode(Node):

    def __init__(self, value=None, pre=None, next=None):
        super().__init__(value, next)
        self.pre = pre

    def __str__(self):
        pre = next = None
        if self.next:
            next = self.next.val
        if self.pre:
            pre = self.pre.val
        return "Node(pre:{0},{1.val!s},next:{2})".format(pre,self,next)

def generateDoubleWayLinkedList(maxnum=20):
    num = random.randint(0, maxnum)
    if num == 0:
        return None
    head = DoubleWayNode(random.choice(string.ascii_uppercase))
    cur = head
    for i in range(1, num):
        cur.next = DoubleWayNode(random.choice(string.ascii_uppercase),pre=cur)
        cur = cur.next
    return head

打印链表

def traverseLinkedList(head):
    cur = head
    while cur:
        print(cur.val, end=",")
        cur = cur.next