mirror of
https://github.com/krahets/hello-algo.git
synced 2026-02-12 15:15:48 +08:00
translation: Add Python and Java code for EN version (#1345)
* Add the intial translation of code of all the languages * test * revert * Remove * Add Python and Java code for EN version
This commit is contained in:
Yudong Jin
129
en/codes/python/chapter_stack_and_queue/array_deque.py
Normal file
129
en/codes/python/chapter_stack_and_queue/array_deque.py
Normal file
@@ -0,0 +1,129 @@
|
||||
"""
|
||||
File: array_deque.py
|
||||
Created Time: 2023-03-01
|
||||
Author: krahets (krahets@163.com)
|
||||
"""
|
||||
|
||||
|
||||
class ArrayDeque:
|
||||
"""Double-ended queue class based on circular array"""
|
||||
|
||||
def __init__(self, capacity: int):
|
||||
"""Constructor"""
|
||||
self._nums: list[int] = [0] * capacity
|
||||
self._front: int = 0
|
||||
self._size: int = 0
|
||||
|
||||
def capacity(self) -> int:
|
||||
"""Get the capacity of the double-ended queue"""
|
||||
return len(self._nums)
|
||||
|
||||
def size(self) -> int:
|
||||
"""Get the length of the double-ended queue"""
|
||||
return self._size
|
||||
|
||||
def is_empty(self) -> bool:
|
||||
"""Determine if the double-ended queue is empty"""
|
||||
return self._size == 0
|
||||
|
||||
def index(self, i: int) -> int:
|
||||
"""Calculate circular array index"""
|
||||
# Implement circular array by modulo operation
|
||||
# When i exceeds the tail of the array, return to the head
|
||||
# When i exceeds the head of the array, return to the tail
|
||||
return (i + self.capacity()) % self.capacity()
|
||||
|
||||
def push_first(self, num: int):
|
||||
"""Front enqueue"""
|
||||
if self._size == self.capacity():
|
||||
print("Double-ended queue is full")
|
||||
return
|
||||
# Move the front pointer one position to the left
|
||||
# Implement front crossing the head of the array to return to the tail by modulo operation
|
||||
self._front = self.index(self._front - 1)
|
||||
# Add num to the front
|
||||
self._nums[self._front] = num
|
||||
self._size += 1
|
||||
|
||||
def push_last(self, num: int):
|
||||
"""Rear enqueue"""
|
||||
if self._size == self.capacity():
|
||||
print("Double-ended queue is full")
|
||||
return
|
||||
# Calculate rear pointer, pointing to rear index + 1
|
||||
rear = self.index(self._front + self._size)
|
||||
# Add num to the rear
|
||||
self._nums[rear] = num
|
||||
self._size += 1
|
||||
|
||||
def pop_first(self) -> int:
|
||||
"""Front dequeue"""
|
||||
num = self.peek_first()
|
||||
# Move front pointer one position backward
|
||||
self._front = self.index(self._front + 1)
|
||||
self._size -= 1
|
||||
return num
|
||||
|
||||
def pop_last(self) -> int:
|
||||
"""Rear dequeue"""
|
||||
num = self.peek_last()
|
||||
self._size -= 1
|
||||
return num
|
||||
|
||||
def peek_first(self) -> int:
|
||||
"""Access front element"""
|
||||
if self.is_empty():
|
||||
raise IndexError("Double-ended queue is empty")
|
||||
return self._nums[self._front]
|
||||
|
||||
def peek_last(self) -> int:
|
||||
"""Access rear element"""
|
||||
if self.is_empty():
|
||||
raise IndexError("Double-ended queue is empty")
|
||||
# Calculate rear element index
|
||||
last = self.index(self._front + self._size - 1)
|
||||
return self._nums[last]
|
||||
|
||||
def to_array(self) -> list[int]:
|
||||
"""Return array for printing"""
|
||||
# Only convert elements within valid length range
|
||||
res = []
|
||||
for i in range(self._size):
|
||||
res.append(self._nums[self.index(self._front + i)])
|
||||
return res
|
||||
|
||||
|
||||
"""Driver Code"""
|
||||
if __name__ == "__main__":
|
||||
# Initialize double-ended queue
|
||||
deque = ArrayDeque(10)
|
||||
deque.push_last(3)
|
||||
deque.push_last(2)
|
||||
deque.push_last(5)
|
||||
print("Double-ended queue deque =", deque.to_array())
|
||||
|
||||
# Access element
|
||||
peek_first: int = deque.peek_first()
|
||||
print("Front element peek_first =", peek_first)
|
||||
peek_last: int = deque.peek_last()
|
||||
print("Rear element peek_last =", peek_last)
|
||||
|
||||
# Element enqueue
|
||||
deque.push_last(4)
|
||||
print("Element 4 rear enqueued, deque =", deque.to_array())
|
||||
deque.push_first(1)
|
||||
print("Element 1 front enqueued, deque =", deque.to_array())
|
||||
|
||||
# Element dequeue
|
||||
pop_last: int = deque.pop_last()
|
||||
print("Rear dequeued element =", pop_last, ", deque after rear dequeue =", deque.to_array())
|
||||
pop_first: int = deque.pop_first()
|
||||
print("Front dequeued element =", pop_first, ", deque after front dequeue =", deque.to_array())
|
||||
|
||||
# Get the length of the double-ended queue
|
||||
size: int = deque.size()
|
||||
print("Double-ended queue length size =", size)
|
||||
|
||||
# Determine if the double-ended queue is empty
|
||||
is_empty: bool = deque.is_empty()
|
||||
print("Is the double-ended queue empty =", is_empty)
|
||||
98
en/codes/python/chapter_stack_and_queue/array_queue.py
Normal file
98
en/codes/python/chapter_stack_and_queue/array_queue.py
Normal file
@@ -0,0 +1,98 @@
|
||||
"""
|
||||
File: array_queue.py
|
||||
Created Time: 2022-12-01
|
||||
Author: Peng Chen (pengchzn@gmail.com)
|
||||
"""
|
||||
|
||||
|
||||
class ArrayQueue:
|
||||
"""Queue class based on circular array"""
|
||||
|
||||
def __init__(self, size: int):
|
||||
"""Constructor"""
|
||||
self._nums: list[int] = [0] * size # Array for storing queue elements
|
||||
self._front: int = 0 # Front pointer, pointing to the front element
|
||||
self._size: int = 0 # Queue length
|
||||
|
||||
def capacity(self) -> int:
|
||||
"""Get the capacity of the queue"""
|
||||
return len(self._nums)
|
||||
|
||||
def size(self) -> int:
|
||||
"""Get the length of the queue"""
|
||||
return self._size
|
||||
|
||||
def is_empty(self) -> bool:
|
||||
"""Determine if the queue is empty"""
|
||||
return self._size == 0
|
||||
|
||||
def push(self, num: int):
|
||||
"""Enqueue"""
|
||||
if self._size == self.capacity():
|
||||
raise IndexError("Queue is full")
|
||||
# Calculate rear pointer, pointing to rear index + 1
|
||||
# Use modulo operation to wrap the rear pointer from the end of the array back to the start
|
||||
rear: int = (self._front + self._size) % self.capacity()
|
||||
# Add num to the rear
|
||||
self._nums[rear] = num
|
||||
self._size += 1
|
||||
|
||||
def pop(self) -> int:
|
||||
"""Dequeue"""
|
||||
num: int = self.peek()
|
||||
# Move front pointer one position backward, returning to the head of the array if it exceeds the tail
|
||||
self._front = (self._front + 1) % self.capacity()
|
||||
self._size -= 1
|
||||
return num
|
||||
|
||||
def peek(self) -> int:
|
||||
"""Access front element"""
|
||||
if self.is_empty():
|
||||
raise IndexError("Queue is empty")
|
||||
return self._nums[self._front]
|
||||
|
||||
def to_list(self) -> list[int]:
|
||||
"""Return array for printing"""
|
||||
res = [0] * self.size()
|
||||
j: int = self._front
|
||||
for i in range(self.size()):
|
||||
res[i] = self._nums[(j % self.capacity())]
|
||||
j += 1
|
||||
return res
|
||||
|
||||
|
||||
"""Driver Code"""
|
||||
if __name__ == "__main__":
|
||||
# Initialize queue
|
||||
queue = ArrayQueue(10)
|
||||
|
||||
# Element enqueue
|
||||
queue.push(1)
|
||||
queue.push(3)
|
||||
queue.push(2)
|
||||
queue.push(5)
|
||||
queue.push(4)
|
||||
print("Queue queue =", queue.to_list())
|
||||
|
||||
# Access front element
|
||||
peek: int = queue.peek()
|
||||
print("Front element peek =", peek)
|
||||
|
||||
# Element dequeue
|
||||
pop: int = queue.pop()
|
||||
print("Dequeued element pop =", pop)
|
||||
print("Queue after dequeue =", queue.to_list())
|
||||
|
||||
# Get the length of the queue
|
||||
size: int = queue.size()
|
||||
print("Queue length size =", size)
|
||||
|
||||
# Determine if the queue is empty
|
||||
is_empty: bool = queue.is_empty()
|
||||
print("Is the queue empty =", is_empty)
|
||||
|
||||
# Test circular array
|
||||
for i in range(10):
|
||||
queue.push(i)
|
||||
queue.pop()
|
||||
print("In the ", i, "th round of enqueue + dequeue, queue = ", queue.to_list())
|
||||
72
en/codes/python/chapter_stack_and_queue/array_stack.py
Normal file
72
en/codes/python/chapter_stack_and_queue/array_stack.py
Normal file
@@ -0,0 +1,72 @@
|
||||
"""
|
||||
File: array_stack.py
|
||||
Created Time: 2022-11-29
|
||||
Author: Peng Chen (pengchzn@gmail.com)
|
||||
"""
|
||||
|
||||
|
||||
class ArrayStack:
|
||||
"""Stack class based on array"""
|
||||
|
||||
def __init__(self):
|
||||
"""Constructor"""
|
||||
self._stack: list[int] = []
|
||||
|
||||
def size(self) -> int:
|
||||
"""Get the length of the stack"""
|
||||
return len(self._stack)
|
||||
|
||||
def is_empty(self) -> bool:
|
||||
"""Determine if the stack is empty"""
|
||||
return self.size() == 0
|
||||
|
||||
def push(self, item: int):
|
||||
"""Push"""
|
||||
self._stack.append(item)
|
||||
|
||||
def pop(self) -> int:
|
||||
"""Pop"""
|
||||
if self.is_empty():
|
||||
raise IndexError("Stack is empty")
|
||||
return self._stack.pop()
|
||||
|
||||
def peek(self) -> int:
|
||||
"""Access stack top element"""
|
||||
if self.is_empty():
|
||||
raise IndexError("Stack is empty")
|
||||
return self._stack[-1]
|
||||
|
||||
def to_list(self) -> list[int]:
|
||||
"""Return array for printing"""
|
||||
return self._stack
|
||||
|
||||
|
||||
"""Driver Code"""
|
||||
if __name__ == "__main__":
|
||||
# Initialize stack
|
||||
stack = ArrayStack()
|
||||
|
||||
# Element push
|
||||
stack.push(1)
|
||||
stack.push(3)
|
||||
stack.push(2)
|
||||
stack.push(5)
|
||||
stack.push(4)
|
||||
print("Stack stack =", stack.to_list())
|
||||
|
||||
# Access stack top element
|
||||
peek: int = stack.peek()
|
||||
print("Stack top element peek =", peek)
|
||||
|
||||
# Element pop
|
||||
pop: int = stack.pop()
|
||||
print("Popped element pop =", pop)
|
||||
print("Stack after pop =", stack.to_list())
|
||||
|
||||
# Get the length of the stack
|
||||
size: int = stack.size()
|
||||
print("Stack length size =", size)
|
||||
|
||||
# Determine if it's empty
|
||||
is_empty: bool = stack.is_empty()
|
||||
print("Is the stack empty =", is_empty)
|
||||
42
en/codes/python/chapter_stack_and_queue/deque.py
Normal file
42
en/codes/python/chapter_stack_and_queue/deque.py
Normal file
@@ -0,0 +1,42 @@
|
||||
"""
|
||||
File: deque.py
|
||||
Created Time: 2022-11-29
|
||||
Author: Peng Chen (pengchzn@gmail.com)
|
||||
"""
|
||||
|
||||
from collections import deque
|
||||
|
||||
"""Driver Code"""
|
||||
if __name__ == "__main__":
|
||||
# Initialize double-ended queue
|
||||
deq: deque[int] = deque()
|
||||
|
||||
# Element enqueue
|
||||
deq.append(2) # Add to rear
|
||||
deq.append(5)
|
||||
deq.append(4)
|
||||
deq.appendleft(3) # Add to front
|
||||
deq.appendleft(1)
|
||||
print("Double-ended queue deque =", deq)
|
||||
|
||||
# Access element
|
||||
front: int = deq[0] # Front element
|
||||
print("Front element front =", front)
|
||||
rear: int = deq[-1] # Rear element
|
||||
print("Rear element rear =", rear)
|
||||
|
||||
# Element dequeue
|
||||
pop_front: int = deq.popleft() # Front element dequeue
|
||||
print("Front dequeued element pop_front =", pop_front)
|
||||
print("Deque after front dequeue =", deq)
|
||||
pop_rear: int = deq.pop() # Rear element dequeue
|
||||
print("Rear dequeued element pop_rear =", pop_rear)
|
||||
print("Deque after rear dequeue =", deq)
|
||||
|
||||
# Get the length of the double-ended queue
|
||||
size: int = len(deq)
|
||||
print("Double-ended queue length size =", size)
|
||||
|
||||
# Determine if the double-ended queue is empty
|
||||
is_empty: bool = len(deq) == 0
|
||||
print("Is the double-ended queue empty =", is_empty)
|
||||
151
en/codes/python/chapter_stack_and_queue/linkedlist_deque.py
Normal file
151
en/codes/python/chapter_stack_and_queue/linkedlist_deque.py
Normal file
@@ -0,0 +1,151 @@
|
||||
"""
|
||||
File: linkedlist_deque.py
|
||||
Created Time: 2023-03-01
|
||||
Author: krahets (krahets@163.com)
|
||||
"""
|
||||
|
||||
|
||||
class ListNode:
|
||||
"""Double-linked list node"""
|
||||
|
||||
def __init__(self, val: int):
|
||||
"""Constructor"""
|
||||
self.val: int = val
|
||||
self.next: ListNode | None = None # Reference to the next node
|
||||
self.prev: ListNode | None = None # Reference to predecessor node
|
||||
|
||||
|
||||
class LinkedListDeque:
|
||||
"""Double-ended queue class based on double-linked list"""
|
||||
|
||||
def __init__(self):
|
||||
"""Constructor"""
|
||||
self._front: ListNode | None = None # Head node front
|
||||
self._rear: ListNode | None = None # Tail node rear
|
||||
self._size: int = 0 # Length of the double-ended queue
|
||||
|
||||
def size(self) -> int:
|
||||
"""Get the length of the double-ended queue"""
|
||||
return self._size
|
||||
|
||||
def is_empty(self) -> bool:
|
||||
"""Determine if the double-ended queue is empty"""
|
||||
return self._size == 0
|
||||
|
||||
def push(self, num: int, is_front: bool):
|
||||
"""Enqueue operation"""
|
||||
node = ListNode(num)
|
||||
# If the list is empty, make front and rear both point to node
|
||||
if self.is_empty():
|
||||
self._front = self._rear = node
|
||||
# Front enqueue operation
|
||||
elif is_front:
|
||||
# Add node to the head of the list
|
||||
self._front.prev = node
|
||||
node.next = self._front
|
||||
self._front = node # Update head node
|
||||
# Rear enqueue operation
|
||||
else:
|
||||
# Add node to the tail of the list
|
||||
self._rear.next = node
|
||||
node.prev = self._rear
|
||||
self._rear = node # Update tail node
|
||||
self._size += 1 # Update queue length
|
||||
|
||||
def push_first(self, num: int):
|
||||
"""Front enqueue"""
|
||||
self.push(num, True)
|
||||
|
||||
def push_last(self, num: int):
|
||||
"""Rear enqueue"""
|
||||
self.push(num, False)
|
||||
|
||||
def pop(self, is_front: bool) -> int:
|
||||
"""Dequeue operation"""
|
||||
if self.is_empty():
|
||||
raise IndexError("Double-ended queue is empty")
|
||||
# Front dequeue operation
|
||||
if is_front:
|
||||
val: int = self._front.val # Temporarily store the head node value
|
||||
# Remove head node
|
||||
fnext: ListNode | None = self._front.next
|
||||
if fnext != None:
|
||||
fnext.prev = None
|
||||
self._front.next = None
|
||||
self._front = fnext # Update head node
|
||||
# Rear dequeue operation
|
||||
else:
|
||||
val: int = self._rear.val # Temporarily store the tail node value
|
||||
# Remove tail node
|
||||
rprev: ListNode | None = self._rear.prev
|
||||
if rprev != None:
|
||||
rprev.next = None
|
||||
self._rear.prev = None
|
||||
self._rear = rprev # Update tail node
|
||||
self._size -= 1 # Update queue length
|
||||
return val
|
||||
|
||||
def pop_first(self) -> int:
|
||||
"""Front dequeue"""
|
||||
return self.pop(True)
|
||||
|
||||
def pop_last(self) -> int:
|
||||
"""Rear dequeue"""
|
||||
return self.pop(False)
|
||||
|
||||
def peek_first(self) -> int:
|
||||
"""Access front element"""
|
||||
if self.is_empty():
|
||||
raise IndexError("Double-ended queue is empty")
|
||||
return self._front.val
|
||||
|
||||
def peek_last(self) -> int:
|
||||
"""Access rear element"""
|
||||
if self.is_empty():
|
||||
raise IndexError("Double-ended queue is empty")
|
||||
return self._rear.val
|
||||
|
||||
def to_array(self) -> list[int]:
|
||||
"""Return array for printing"""
|
||||
node = self._front
|
||||
res = [0] * self.size()
|
||||
for i in range(self.size()):
|
||||
res[i] = node.val
|
||||
node = node.next
|
||||
return res
|
||||
|
||||
|
||||
"""Driver Code"""
|
||||
if __name__ == "__main__":
|
||||
# Initialize double-ended queue
|
||||
deque = LinkedListDeque()
|
||||
deque.push_last(3)
|
||||
deque.push_last(2)
|
||||
deque.push_last(5)
|
||||
print("Double-ended queue deque =", deque.to_array())
|
||||
|
||||
# Access element
|
||||
peek_first: int = deque.peek_first()
|
||||
print("Front element peek_first =", peek_first)
|
||||
peek_last: int = deque.peek_last()
|
||||
print("Rear element peek_last =", peek_last)
|
||||
|
||||
# Element enqueue
|
||||
deque.push_last(4)
|
||||
print("Element 4 rear enqueued, deque =", deque.to_array())
|
||||
deque.push_first(1)
|
||||
print("Element 1 front enqueued, deque =", deque.to_array())
|
||||
|
||||
# Element dequeue
|
||||
pop_last: int = deque.pop_last()
|
||||
print("Rear dequeued element =", pop_last, ", deque after rear dequeue =", deque.to_array())
|
||||
pop_first: int = deque.pop_first()
|
||||
print("Front dequeued element =", pop_first, ", deque after front dequeue =", deque.to_array())
|
||||
|
||||
# Get the length of the double-ended queue
|
||||
size: int = deque.size()
|
||||
print("Double-ended queue length size =", size)
|
||||
|
||||
# Determine if the double-ended queue is empty
|
||||
is_empty: bool = deque.is_empty()
|
||||
print("Is the double-ended queue empty =", is_empty)
|
||||
97
en/codes/python/chapter_stack_and_queue/linkedlist_queue.py
Normal file
97
en/codes/python/chapter_stack_and_queue/linkedlist_queue.py
Normal file
@@ -0,0 +1,97 @@
|
||||
"""
|
||||
File: linkedlist_queue.py
|
||||
Created Time: 2022-12-01
|
||||
Author: Peng Chen (pengchzn@gmail.com)
|
||||
"""
|
||||
|
||||
import sys
|
||||
from pathlib import Path
|
||||
|
||||
sys.path.append(str(Path(__file__).parent.parent))
|
||||
from modules import ListNode
|
||||
|
||||
|
||||
class LinkedListQueue:
|
||||
"""Queue class based on linked list"""
|
||||
|
||||
def __init__(self):
|
||||
"""Constructor"""
|
||||
self._front: ListNode | None = None # Head node front
|
||||
self._rear: ListNode | None = None # Tail node rear
|
||||
self._size: int = 0
|
||||
|
||||
def size(self) -> int:
|
||||
"""Get the length of the queue"""
|
||||
return self._size
|
||||
|
||||
def is_empty(self) -> bool:
|
||||
"""Determine if the queue is empty"""
|
||||
return self._size == 0
|
||||
|
||||
def push(self, num: int):
|
||||
"""Enqueue"""
|
||||
# Add num behind the tail node
|
||||
node = ListNode(num)
|
||||
# If the queue is empty, make the head and tail nodes both point to that node
|
||||
if self._front is None:
|
||||
self._front = node
|
||||
self._rear = node
|
||||
# If the queue is not empty, add that node behind the tail node
|
||||
else:
|
||||
self._rear.next = node
|
||||
self._rear = node
|
||||
self._size += 1
|
||||
|
||||
def pop(self) -> int:
|
||||
"""Dequeue"""
|
||||
num = self.peek()
|
||||
# Remove head node
|
||||
self._front = self._front.next
|
||||
self._size -= 1
|
||||
return num
|
||||
|
||||
def peek(self) -> int:
|
||||
"""Access front element"""
|
||||
if self.is_empty():
|
||||
raise IndexError("Queue is empty")
|
||||
return self._front.val
|
||||
|
||||
def to_list(self) -> list[int]:
|
||||
"""Convert to a list for printing"""
|
||||
queue = []
|
||||
temp = self._front
|
||||
while temp:
|
||||
queue.append(temp.val)
|
||||
temp = temp.next
|
||||
return queue
|
||||
|
||||
|
||||
"""Driver Code"""
|
||||
if __name__ == "__main__":
|
||||
# Initialize queue
|
||||
queue = LinkedListQueue()
|
||||
|
||||
# Element enqueue
|
||||
queue.push(1)
|
||||
queue.push(3)
|
||||
queue.push(2)
|
||||
queue.push(5)
|
||||
queue.push(4)
|
||||
print("Queue queue =", queue.to_list())
|
||||
|
||||
# Access front element
|
||||
peek: int = queue.peek()
|
||||
print("Front element front =", peek)
|
||||
|
||||
# Element dequeue
|
||||
pop_front: int = queue.pop()
|
||||
print("Dequeued element pop =", pop_front)
|
||||
print("Queue after dequeue =", queue.to_list())
|
||||
|
||||
# Get the length of the queue
|
||||
size: int = queue.size()
|
||||
print("Queue length size =", size)
|
||||
|
||||
# Determine if the queue is empty
|
||||
is_empty: bool = queue.is_empty()
|
||||
print("Is the queue empty =", is_empty)
|
||||
89
en/codes/python/chapter_stack_and_queue/linkedlist_stack.py
Normal file
89
en/codes/python/chapter_stack_and_queue/linkedlist_stack.py
Normal file
@@ -0,0 +1,89 @@
|
||||
"""
|
||||
File: linkedlist_stack.py
|
||||
Created Time: 2022-11-29
|
||||
Author: Peng Chen (pengchzn@gmail.com)
|
||||
"""
|
||||
|
||||
import sys
|
||||
from pathlib import Path
|
||||
|
||||
sys.path.append(str(Path(__file__).parent.parent))
|
||||
from modules import ListNode
|
||||
|
||||
|
||||
class LinkedListStack:
|
||||
"""Stack class based on linked list"""
|
||||
|
||||
def __init__(self):
|
||||
"""Constructor"""
|
||||
self._peek: ListNode | None = None
|
||||
self._size: int = 0
|
||||
|
||||
def size(self) -> int:
|
||||
"""Get the length of the stack"""
|
||||
return self._size
|
||||
|
||||
def is_empty(self) -> bool:
|
||||
"""Determine if the stack is empty"""
|
||||
return self._size == 0
|
||||
|
||||
def push(self, val: int):
|
||||
"""Push"""
|
||||
node = ListNode(val)
|
||||
node.next = self._peek
|
||||
self._peek = node
|
||||
self._size += 1
|
||||
|
||||
def pop(self) -> int:
|
||||
"""Pop"""
|
||||
num = self.peek()
|
||||
self._peek = self._peek.next
|
||||
self._size -= 1
|
||||
return num
|
||||
|
||||
def peek(self) -> int:
|
||||
"""Access stack top element"""
|
||||
if self.is_empty():
|
||||
raise IndexError("Stack is empty")
|
||||
return self._peek.val
|
||||
|
||||
def to_list(self) -> list[int]:
|
||||
"""Convert to a list for printing"""
|
||||
arr = []
|
||||
node = self._peek
|
||||
while node:
|
||||
arr.append(node.val)
|
||||
node = node.next
|
||||
arr.reverse()
|
||||
return arr
|
||||
|
||||
|
||||
"""Driver Code"""
|
||||
if __name__ == "__main__":
|
||||
# Initialize stack
|
||||
stack = LinkedListStack()
|
||||
|
||||
# Element push
|
||||
stack.push(1)
|
||||
stack.push(3)
|
||||
stack.push(2)
|
||||
stack.push(5)
|
||||
stack.push(4)
|
||||
print("Stack stack =", stack.to_list())
|
||||
|
||||
# Access stack top element
|
||||
peek: int = stack.peek()
|
||||
print("Stack top element peek =", peek)
|
||||
|
||||
# Element pop
|
||||
pop: int = stack.pop()
|
||||
print("Popped element pop =", pop)
|
||||
print("Stack after pop =", stack.to_list())
|
||||
|
||||
# Get the length of the stack
|
||||
size: int = stack.size()
|
||||
print("Stack length size =", size)
|
||||
|
||||
# Determine if it's empty
|
||||
is_empty: bool = stack.is_empty()
|
||||
print("Is the stack empty =", is_empty)
|
||||
39
en/codes/python/chapter_stack_and_queue/queue.py
Normal file
39
en/codes/python/chapter_stack_and_queue/queue.py
Normal file
@@ -0,0 +1,39 @@
|
||||
"""
|
||||
File: queue.py
|
||||
Created Time: 2022-11-29
|
||||
Author: Peng Chen (pengchzn@gmail.com)
|
||||
"""
|
||||
|
||||
from collections import deque
|
||||
|
||||
"""Driver Code"""
|
||||
if __name__ == "__main__":
|
||||
# Initialize queue
|
||||
# In Python, we generally consider the deque class as a queue
|
||||
# Although queue.Queue() is a pure queue class, it's not very user-friendly
|
||||
que: deque[int] = deque()
|
||||
|
||||
# Element enqueue
|
||||
que.append(1)
|
||||
que.append(3)
|
||||
que.append(2)
|
||||
que.append(5)
|
||||
que.append(4)
|
||||
print("Queue que =", que)
|
||||
|
||||
# Access front element
|
||||
front: int = que[0]
|
||||
print("Front element front =", front)
|
||||
|
||||
# Element dequeue
|
||||
pop: int = que.popleft()
|
||||
print("Dequeued element pop =", pop)
|
||||
print("Queue after dequeue =", que)
|
||||
|
||||
# Get the length of the queue
|
||||
size: int = len(que)
|
||||
print("Queue length size =", size)
|
||||
|
||||
# Determine if the queue is empty
|
||||
is_empty: bool = len(que) == 0
|
||||
print("Is the queue empty =", is_empty)
|
||||
36
en/codes/python/chapter_stack_and_queue/stack.py
Normal file
36
en/codes/python/chapter_stack_and_queue/stack.py
Normal file
@@ -0,0 +1,36 @@
|
||||
"""
|
||||
File: stack.py
|
||||
Created Time: 2022-11-29
|
||||
Author: Peng Chen (pengchzn@gmail.com)
|
||||
"""
|
||||
|
||||
"""Driver Code"""
|
||||
if __name__ == "__main__":
|
||||
# Initialize stack
|
||||
# Python does not have a built-in stack class, but you can use a list as a stack
|
||||
stack: list[int] = []
|
||||
|
||||
# Element push
|
||||
stack.append(1)
|
||||
stack.append(3)
|
||||
stack.append(2)
|
||||
stack.append(5)
|
||||
stack.append(4)
|
||||
print("Stack stack =", stack)
|
||||
|
||||
# Access stack top element
|
||||
peek: int = stack[-1]
|
||||
print("Stack top element peek =", peek)
|
||||
|
||||
# Element pop
|
||||
pop: int = stack.pop()
|
||||
print("Popped element pop =", pop)
|
||||
print("Stack after pop =", stack)
|
||||
|
||||
# Get the length of the stack
|
||||
size: int = len(stack)
|
||||
print("Stack length size =", size)
|
||||
|
||||
# Determine if it's empty
|
||||
is_empty: bool = len(stack) == 0
|
||||
print("Is the stack empty =", is_empty)
|
||||
Reference in New Issue
Block a user