python数据结构之单向循环链表的实现

python数据结构之单向循环链表的实现

单向循环链表：
在单向链表中，头指针是相当重要的，因为单向链表的操作都需要头指针，所以如果头指针丢失或者破坏，那么整个链表都会遗失，并且浪费链表内存空间。

单向循环链表的构成：
如果把单链表的最后一个节点的指针指向链表头部，而不是指向NULL，那么就构成了一个单向循环链表。

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:
            node.next = node

    def is_empty(self):
        """链表是否为空"""
        return self.__head == None

    def length(self):
        """链表长度"""
        if self.is_empty():
            return 0
        current_node = self.__head
        count = 1
        while current_node.next != self.__head:
            count += 1
            current_node = current_node.next
        return count

    def travel(self):
        """遍历整个链表"""
        if self.is_empty():
            return
        current_node = self.__head
        while current_node.next != self.__head:
            print(current_node.elem, end=" ")
            current_node = current_node.next
        print(current_node.elem)

    def add(self, item):
        """链表头部添加元素，头插法"""
        node = Node(item)
        if self.is_empty():
            self.__head = node
            node.next = node
        else:
            current_node = self.__head
            while current_node.next != self.__head:
                current_node = current_node.next
            # 退出循环，指向尾节点
            node.next = self.__head
            self.__head = node
            # cur.next = node
            current_node.next = self.__head

    def append(self, item):
        """链表尾部添加元素, 尾插法"""
        node = Node(item)
        if self.is_empty():
            self.__head = node
            node.next = node
        else:
            current_node = self.__head
            while current_node.next != self.__head:
                current_node = current_node.next
            node.next = self.__head
            current_node.next = node

    def insert(self, index, item):
        """指定位置添加元素
        :param  index 从0开始
        """
        if index <= 0:
            self.add(item)
        elif index > (self.length() - 1):
            self.append(item)
        else:
            pre = self.__head
            count = 0
            while count < (index - 1):
                count += 1
                pre = pre.next
            node = Node(item)
            node.next = pre.next
            pre.next = node
    def search(self, item):
        """查找节点是否存在"""
        if self.is_empty():
            return False
        current_node = self.__head
        while current_node.next != self.__head:
            if current_node.elem == item:
                return True
            else:
                current_node = current_node.next
        if current_node.elem == item:
            return True
        return False

    def remove(self, item):
        """删除节点"""
        if self.is_empty():
            return
        pre_node = None
        current_node = self.__head
        while current_node.next is not self.__head:
            if item == current_node.item:
                if pre_node:
                    pre_node.next = current_node.next
                else:
                    # 头结点的情况
                    tail_node = self.__head
                    while tail_node.next is not self.__head:
                        tail_node = tail_node.next
                    self.__head = current_node.next
                    tail_node.next = self.__head
                break
            else:
                pre_node = current_node
                current_node = current_node.next
        if item == current_node.item:
            # 尾节点是所要删除节点的情况
            if self.length() == 1:
                self.__head = None
            else:
                pre_node.next = current_node.next


if __name__ == "__main__":
    cycle_link = SingleCycleLinkList()
    print(cycle_link.is_empty())
    print(cycle_link.length())
    cycle_link.travel()

    cycle_link.add(1)
    print('****************')
    cycle_link.travel()
    cycle_link.remove(1)
    cycle_link.travel()
    print('**************')
    print(cycle_link.is_empty(), cycle_link.length())
    cycle_link.travel()

    cycle_link.add(2)
    print(cycle_link.is_empty(), cycle_link.length())
    cycle_link.travel()

    cycle_link.append(0)
    cycle_link.append(-1)
    cycle_link.travel()

    print(cycle_link.search(4))
    print(cycle_link.search(1))
    cycle_link.travel()

    cycle_link.insert(1, 100)
    cycle_link.travel()
    cycle_link.insert(0, 200)
    cycle_link.travel()
    cycle_link.insert(5, 600)
    cycle_link.travel()

    print('****************************')
    cycle_link.remove(600)
    cycle_link.travel()