Git-Mirrors/master-algorithms-py
1
0
Fork 0
mirror of https://github.com/autistic-symposium/master-algorithms-py.git synced 2025-04-29 20:26:07 -04:00
Code Issues Packages Projects Releases Wiki Activity

Update circular_queue_array.py

Browse Source
This commit is contained in:
marina 2023-08-07 18:51:39 -07:00 committed by GitHub
parent 5ab9d7582a
commit 2c1df477e2
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 6 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

14
queues/circular_queue_array.py
View File

@ -5,22 +5,19 @@
class CircularQueue: class CircularQueue:
def __init__(self, k: int): def __init__(self, size):
self.head = 0 self.head = 0
self.tail = 0 self.tail = 0
self.size = k self.size = size
self.queue = [None] * self.size self.queue = [None] * self.size
def enqueue(self, value: int) -> bool: def enqueue(self, value: int) -> bool:
if value is None:
return False
if self.is_full(): if self.is_full():
return False return False
if self.is_empty(): if self.is_empty():
self.heard = 0 self.head = 0
while self.queue[self.tail] is not None: while self.queue[self.tail] is not None:
self.tail += 1 self.tail += 1
@ -28,6 +25,7 @@ class CircularQueue:
self.tail = 0 self.tail = 0
self.queue[self.tail] = value self.queue[self.tail] = value
return True return True
def dequeue(self) -> bool: def dequeue(self) -> bool:
@ -45,10 +43,10 @@ class CircularQueue:
return True return True
def front(self) -> int: def front(self) -> int:
return self.queue[self.head] or -1 return self.queue[self.head] or False
def rear(self) -> int: def rear(self) -> int:
return self.queue[self.tail] or -1 return self.queue[self.tail] or False
def is_empty(self) -> bool: def is_empty(self) -> bool:
for n in self.queue: for n in self.queue: