# 環形連結串列----------------------------------------
class AnnularList:
    def __init__(self, value):
        self.elem = value
        self.next = None


class AnnularListHandle:
    def __init__(self):
        self.front = None
        self.rear = None
        self._length = 0

    def insert_node(self, value, position, times)
 
:  # 增加節點
        if position is not None:  # 指定前端插入還是後端插入
            if position == o:  # 前端插入
                p = AnnularList(value)
                p.next = self.front
                self.front = p.elem
                self.rear.next = self.front
                self._length = self._length - 1
                return
 

            elif position == 1:  # 後端插入
                p = AnnularList(value)
                p.next = self.front
                self.rear = p.elem
                self._length = self._length - 1
                return
            else:
                print('呼叫錯誤')
                return
        elif
 
 times is not None:  # 指定位置節點插入
            if times == 0:  # 在首端插入節點
                p = AnnularList(value)
                p.next = self.front
                self.front = p.elem
                self.rear.next = self.front
                self._length = self._length - 1
                return
            elif times == self._length:  # 在尾端插入節點
                p = AnnularList(value)
                p.next = self.front
                self.rear.next = p.elem
                self._length = self._length - 1
                return
            elif type(times) is Number:  # 在中間插入節點（除首端和尾端）
                p_new = AnnularList(value)
                temp = 0
                p_1 = self.front
                while temp == times - 1:
                    p_1 = p_1.next
                    temp += 1
                p_2 = p_1.next
                p_1.next = p_new
                p_new.next = p_2
                self._length = self._length + 1
                return
            else:  # 輸入的times不是數字型別
                print('呼叫錯誤')
                return
        else:
            print('呼叫錯誤')
            return

    def ergodic_list(self):  # 遍歷環形連結串列
        p = self.front
        temp = 0
        while temp < self._length:
            print(p.elem)
            p = p.next
        return

    def delete_node(self, value):  # 刪除節點
        if self.front.elem == value:  # 刪除的值在首節點
            self.front = self.front.next
            self.rear.next = self.front.elem
            self._length = self._length - 1
        elif self.rear.elem == value:  # 刪除的值在尾節點
            p = self.front
            temp = 0
            while temp < self._length:
                p = p.next
            self.rear = p.elem
            self.rear.next = self.front
            self._length = self._length - 1
        else:  # 刪除的值在中間（除尾部和首部）
            p_1 = self.front
            p_2 = p_1.next
            n = 0
            while p_2 != self.rear:
                if value == p.elem.next:
                    p.next = p.next.next
                    n += 1
                    p = p.next
                p = p.next
        return

    def reversal_list(self):  # 反轉環形連結串列
        p_1 = self.head
        p = self.head
        p_2 = p_1.next
        p_1.next = None
        while p.next is not None:
            p_2.next = p_1.elem
            p_1 = p_1.next
            p_2 = p_2.next
        p.head = p_2.elem
        return