py004 - python 单向循环链表 代码

Code:

class Node(object):
    """结点"""
    def __init__(self, elem):
        self.elem = elem
        self.next = None

class SingleCycleLinklist(object):
    """单链表"""

    def __init__(self, node = None):
        self.__head = node
        if node != None:
            node.next = node

    def is_empty(self):
        """判断单链表是否为空"""
        return self.__head is None

    def length(self):
        """单链表长度"""
        if self.is_empty():
            return 0
        cur = self.__head  # 设置游标cur
        count = 1  # 设置计数器
        while cur.next != self.__head:
            count += 1
            cur = cur.next
        return count

    def travel(self):
        """遍历单链表"""
        if self.is_empty():
            print("空表")
            return
        cur = self.__head  # 设置游标cur
        while cur.next != self.__head:
            print(cur.elem, end=" ")
            cur = cur.next
        print(cur.elem)
        print("链表断没有？",'No!' if cur.next is self.__head else 'yes!')

    def add(self, elem):
        """在表头增加一个元素"""
        if self.is_empty():
            self.__head = node
            node.next = node
        node = Node(elem)
        cur = self.__head
        while cur.next != self.__head:
            cur = cur.next
        cur.next = node 
        node.next = self.__head
        self.__head = node

    def append(self, elem):
        """在表尾增加元素"""
        node = Node(elem)
        if self.is_empty():
            self.__head = node
            node.next = node
        else:
            cur = self.__head  # 设置游标
            while cur.next != self.__head:
                cur = cur.next
            cur.next = node
            node.next = self.__head
    def insert(self, pos, elem):
        """在指定处增加元素
        :param pos 从0开始 
        """
        if pos <= 0:
            self.add(elem)
        elif pos >= (self.length()-1):
            self.append(elem)
        else:
            node = Node(elem)
            i = 0
            cur = self.__head
            while i < (pos-1):
                cur = cur.next
                i += 1
            node.next = cur.next
            cur.next = node

    def remove(self, elem):
        """删除某一元素"""
        if self.is_empty():
            print("SingleLinklist is none!")
            return False
        cur = self.__head
        pre = None
        mark = False
        while cur.next != self.__head:
            if cur.elem != elem:
                pre = cur
                cur = cur.next
            else:
                mark = True
                if cur == self.__head:
                    # 头节点要特殊处理
                    self.__head = self.__head.next    
                    cur = self.__head
                else: 
                    pre.next = cur.next 
                    cur = cur.next
        if cur.elem == elem:
            pre.next = cur.next
        print(mark)  # 显示是否删除成功

    def search(self, elem):
        """查找某一元素"""
        if self.is_empty():
            return False
        cur = self.__head
        count = 0
        while cur.next != self.__head:
            if cur.elem == elem:
                return count 
            cur = cur.next
            count += 1
        if cur.elem == elem:
            return count
        return False

if __name__ == "__main__":
    li = SingleCycleLinklist()
    print("添加与遍历测试:")
    print(li.is_empty())
    li.remove(666)
    li.append(1)
    print(li.is_empty())
    li.append(2)
    li.append(3)
    li.append(4)
    li.append(5)
    li.append(6)
    li.travel()
    print(li.length())
    print()
    li.add(0)
    li.append(8)
    li.travel()
    li.insert(3, 666)
    li.travel()
    li.insert(13, 666)
    li.insert(-3, 1000)
    li.travel()
    print("-" * 10)
    print("查找测试:")
    print(li.search(1000))
    print(li.search(7))
    print(li.search(8))
    print("-" * 10)
    print("删除测试")
    li.insert(3, 666)
    li.insert(3, 666)
    li.insert(3, 666)
    li.travel()
    li.remove(666)
    li.remove(666)
    li.travel()
    li.remove(6)
    li.travel()
    li.remove(1000)
    li.remove(8)
    li.travel()
    li.append(6)
    li.travel()
    li.append(6)
    li.travel()

OUTPUT