Как реализовать кольцевой список в python?

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39

class Node:
    def __init__(self, data):
        self.data = data
        self.next = None

class CircularLinkedList:
    def __init__(self):
        self.head = None

    def insert(self, data):
        new_node = Node(data)
        if self.head is None:
            self.head = new_node
            new_node.next = self.head
        else:
            temp = self.head
            while temp.next != self.head:
                temp = temp.next
            temp.next = new_node
            new_node.next = self.head

    def display(self):
        if self.head is None:
            print("List is empty")
        else:
            temp = self.head
            while True:
                print(temp.data, end=" ")
                temp = temp.next
                if temp == self.head:
                    break

# Пример использования
cll = CircularLinkedList()
cll.insert(1)
cll.insert(2)
cll.insert(3)
cll.insert(4)
cll.display()

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59

class CircularLinkedList:
    def __init__(self):
        self.head = None

    # другие методы вставки, отображения списка

    def delete(self, key):
        if self.head is None:
            print("List is empty")
        elif self.head.data == key:
            if self.head.next == self.head:
                self.head = None
            else:
                temp = self.head
                while temp.next != self.head:
                    temp = temp.next
                temp.next = self.head.next
                self.head = self.head.next
        else:
            prev = None
            curr = self.head
            while curr.data != key:
                if curr.next == self.head:
                    print("Element not found in the list")
                    return
                prev = curr
                curr = curr.next
            prev.next = curr.next

    def search(self, key):
        if self.head is None:
            print("List is empty")
        else:
            temp = self.head
            found = False
            while True:
                if temp.data == key:
                    found = True
                    break
                temp = temp.next
                if temp == self.head:
                    break
            if found:
                print(f"Element {key} found in the list")
            else:
                print(f"Element {key} not found in the list")

# Пример использования
cll = CircularLinkedList()
cll.insert(1)
cll.insert(2)
cll.insert(3)
cll.insert(4)

cll.display()
cll.delete(2)
cll.display()
cll.search(3)