data-structures-algorithms/queue/queue_list.py at main · Bourbxn/data-structures-algorithms · GitHub

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
class Queue:
    def __init__(self) -> None:
        self.queue = list()

    def size(self) -> int:
        return len(self.queue)

    def is_empty(self) -> bool:
        return not bool(len(self.queue))

    def enqueue(self, data: any) -> None:
        self.queue.append(data)

    def dequeue(self) -> any:
        if not self.is_empty():
            return self.queue.pop(0)

    def front(self) -> any:
        return self.queue[0]

    def rear(self) -> any:
        return self.queue[-1]

    def __str__(self) -> str:
        return str(self.queue).replace(', ','->') \
            .replace('[','').replace(']','')

def main():
    pass
    # q = Queue()
    # q.enqueue(1)
    # q.enqueue(2)
    # q.enqueue(3)
    # print(q.dequeue())
    # print(q.front())
    # print(q.rear())
    # print(q)
    # print(s.size())
    # print(s.is_empty())

if __name__ == '__main__':
    main()