数据结构与算法-单向循环链表实现

 单向循环链表

# coding:utf-8
class LinkedListNode(object):
    '''链表节点类'''

    def __init__(self, value):
        # 存储值的地方
        self.value = value
        # 存储下一节点指针（位置）
        self.pointer = None


class LinkedList(object):
    '''链表实现类(单向循环链表）'''

    def __init__(self):
        # 头节点
        self.__head = None

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

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

    def travel(self):
        """遍历整个链表"""
        if self.is_empty():
            return None
        cur = self.__head
        print(cur.value, end=" ")
        while cur.pointer != self.__head:
            cur = cur.pointer
            print(cur.value, end=" ")
        print("")

    def add(self, item):
        """链表头部添加元素"""
        node = LinkedListNode(item)
        if self.is_empty():
            self.__head = node
            node.pointer = self.__head
        else:
            # 添加的节点指向__head
            node.pointer = self.__head
            # 移到链表尾部，将尾部节点的pointer指向node
            cur = self.__head
            while cur.pointer != self.__head:
                cur = cur.pointer
            cur.pointer = node
            # __head指向添加node的
            self.__head = node

    def append(self, item):
        """链表尾部添加元素"""
        node = LinkedListNode(item)

        if self.is_empty():
            self.__head = node
            node.pointer = self.__head
        else:
            # 移到链表尾部
            cur = self.__head
            while cur.pointer != self.__head:
                cur = cur.pointer
            # 将尾节点指向node
            cur.pointer = node
            # 将node指向头节点__head
            node.pointer = self.__head

    def insert(self, pos, item):
        """指定位置添加元素"""
        if pos <= 0:
            self.add(item)
        elif pos > (self.length() - 1):
            self.append(item)
        else:
            node = LinkedListNode(item)
            count = 0
            pre = self.__head
            while count < (pos - 1):
                count += 1
                pre = pre.pointer
            node.pointer = pre.pointer
            pre.pointer = node

    def remove(self, item):
        """删除节点"""
        if self.is_empty():
            return
        cur = self.__head
        pre = None
        while cur.pointer != self.__head:
            if cur.value == item:
                if cur == self.__head:
                    rear = self.__head
                    while rear.pointer != self.__head:
                        rear = rear.pointer
                    self.__head = cur.pointer
                    rear.pointer = self.__head
                else:
                    pre.pointer = cur.pointer
                return
            else:
                pre = cur
                cur = cur.pointer
        if cur.value == item:
            if cur == self.__head:
                self.__head = None
            else:
                pre.pointer = cur.pointer

    def search(self, item):
        """查找节点是否存在"""
        if self.is_empty():
            return False
        cur = self.__head
        while cur.pointer != self.__head:
            if cur.value == item:
                return True
            cur = cur.pointer
        if cur.value == item:
            return True
        return False

    def joseph(self, step):
        """约瑟夫问题"""
        if self.is_empty():
            return False
        if step == 1:
            return False
        count = 1
        pre = None
        cur = self.__head
        while True:
            if self.length() == 1:
                break
            if count == step:
                count = 1
                self.travel()
                pre.pointer = cur.pointer
                cur = pre.pointer
                self.__head = cur
            else:
                pre = cur
                cur = cur.pointer
                count += 1
        return self.__head.value


if __name__ == "__main__":
    ll = LinkedList()
    ll.add(1)
    ll.add(2)
    ll.append(3)
    ll.insert(2, 4)
    ll.insert(4, 5)
    ll.insert(0, 6)
    print("length:", ll.length())
    ll.travel()
    print(ll.search(3))
    print(ll.search(7))
    ll.remove(1)
    print("length:", ll.length())
    ll.travel()
    print(ll.joseph(4))