2.8_single_cycle_link_list_单向循环链表

节点类

class Node(object):

    def __init__(self, item):
        self.item = item
        self.next = None

 

单向循环链表

class SingleCycleLinkList(object):
    """单向循环链表"""

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

    def add(self, item):
        """头插法"""

        node = Node(item)

        if self.is_empty():
            self.__head = node
            node.next = node
        else:
            # 定位尾节点
            cur = self.__head
            while cur.next != self.__head:
                cur = cur.next

            node.next = self.__head
            self.__head = node
            cur.next = node

    def append(self, item):
        """尾插法"""

        node = Node(item)
        if self.is_empty():
            self.__head = node
            node.next = node
        else:
            cur = self.__head
            while cur.next != self.__head:
                cur = cur.next
            node.next = cur.next
            cur.next = node

    def insert(self, pos, item):
        """
        指定位置添加元素
        :param pos: 起始从 0 开始
        :param item: 数据
        :return:
        """

        if pos <= 0:
            self.add(item)
        elif pos > self.length() - 1:
            self.append(item)
        else:
            node = Node(item)
            pre = self.__head
            count = 0
            # 循环退出后，pre 指向 pos - 1 位置
            while count < pos - 1:
                pre = pre.next
                count += 1

            node.next = pre.next
            pre.next = node

    def remove(self, item):
        """删除节点"""

        if self.is_empty():
            return

        cur = self.__head
        pre = None
        while cur.next != self.__head:
            if cur.item == item:
                # 头节点
                if cur == self.__head:
                    # 寻找尾节点的指针 rear
                    rear = self.__head
                    while rear.next != self.__head:
                        rear = rear.next
                    self.__head = cur.next
                    rear.next = self.__head
                else:
                    # 中间节点
                    pre.next = cur.next
                return
            else:
                pre = cur
                cur = cur.next
        # 尾节点
        if cur.item == item:
            # 链表只有一个节点
            if cur == self.__head:
                self.__head = None
            else:
                pre.next = self.__head

    def search(self, item):
        """查找节点是否存在"""

        cur = self.__head
        while cur.next != self.__head:
            if cur.item == item:
                return True
            else:
                cur = cur.next
        return cur.item == item

    def is_empty(self):
        """判断链表是否为空"""

        return self.__head is None

    def length(self):
        """链表长度"""

        if self.is_empty():
            return 0

        cur = self.__head
        count = 1

        while cur.next != self.__head:
            count += 1
            cur = cur.next
        return count

    def travel(self):
        """遍历整个链表"""

        if self.is_empty():
            return

        cur = self.__head
        while cur.next != self.__head:
            print(cur.item, end=' ')
            cur = cur.next
        # 退出循环时，cur 指向尾节点，但尾节点的元素未打印
        print(cur.item)
        # print('')

 

测试代码： 

if __name__ == '__main__':

    # --- testing: is_empty() / length() ---
    ll = SingleCycleLinkList()
    print(ll.is_empty())
    print(ll.length())

    ll.append(1)
    print(ll.is_empty())
    print(ll.length())

    # --- testing: add() / append() / travel() ---
    ll.add(8)
    ll.append(2)
    ll.append(3)
    ll.append(4)
    ll.append(5)
    ll.append(6)
    ll.travel()         # 8 1 2 3 4 5 6

    # --- testing: insert() ---
    ll.insert(-1, 9)    # 9 8 1 2 3 4 5 6
    ll.travel()
    ll.insert(3, 100)   # 9 8 1 100 2 3 4 5 6
    ll.travel()
    ll.insert(10, 200)  # 9 8 1 100 2 3 4 5 6 200
    ll.travel()

    # --- testing: remove() ---
    ll.remove(100)
    ll.travel()         # 9 8 1 2 3 4 5 6 200
    ll.remove(9)
    ll.travel()         # 8 1 2 3 4 5 6 200
    ll.remove(200)
    ll.travel()         # 8 1 2 3 4 5 6