定义一个链表的小例子

定义一个链表实现英雄的排行榜

class Hero(object):
    def __init__(self, no=None, nickname=None, name=None, pNext = None):
        self.no = no
        self.nickname = nickname
        self.name = name
        self.pNext = pNext

# 添加节点
def addHero(head, pNew):
    cur = head
    # while cur.pNext != None:
    #     cur = cur.pNext
    #
    # cur.pNext = pNew

    while cur.pNext != None:
        if cur.pNext.no > pNew.no:
            # pNew.pNext = cur.pNext
            # cur.pNext = pNew
            break

        cur = cur.pNext
    #思考为什么把这两行代码不放在while里面，而是放在这。
    pNew.pNext = cur.pNext
    cur.pNext = pNew
# 遍历节点
def showHero(head):
    if isEmpty(head):
        return None

    cur = head

    while cur.pNext != None:
        print("英雄的编号是: %s, 外号是：%s, 姓名:%s" % (cur.pNext.no, cur.pNext.nickname, cur.pNext.name))
        cur = cur.pNext

#判断是否为空
def isEmpty(head):
    if head.pNext != None:
        return False
    return True

#删除
def delHero(head, no):
    cur = head

    while cur.pNext != None:
        if no == cur.pNext.no:
            cur.pNext=cur.pNext.pNext
            break
        cur = cur.pNext
    else:
        print('没有找到')

    ### 链表的长度
def getLength(head):
    length = 0
    cur = head
    while cur.pNext != None:
        cur = cur.pNext
        length = length + 1

    return length


# 头结点
head = Hero()

## 首节点
h1 = Hero(1, '及时雨', '宋江')
h2 = Hero(2, '玉麒麟', '卢俊义')
h3 = Hero(6, '豹子头', '林冲')
h4 = Hero(4, '入云龙', '公孙胜')

addHero(head, h1)
addHero(head, h2)
addHero(head, h3)
addHero(head, h4)

showHero(head)
delHero(head,2)
showHero(head)
print(getLength(head))