stack.py

stack.py

stack.py是Python中的Lifo stack＆FIFO隊列實現。它不是不同的數據類型，但可以將其視為一種。

lifo-最後，首先。最後要進入的要素將是第一個出門的元素。

FIFO-首先，首先。進入的第一個元素將是第一個出門的元素。

徽章

提供：Shields.io

致謝

• 問題
• 拉請求
• 查看PYPI項目

作者

• @Rudransh Joshi

安裝

最簡單的方法是使用PIP安裝stack.py

  pip install stack.py

用法 /示例

堆

 from stack import Stack
s = Stack ( 6 )  # Create a LIFO stack with stack length 6
s . put ( 1 )  # Pushing some elements to the stack
s . put ( 2 )
s . put ( 3 )
s . get ()  # Gets an element from the stack, pops it
s . list  # Returns the elements of stack as a list
s . top  # Returns the index of top pointer of the stack
s . list [ s . top ] # Returns the value of the element at top
s . empty  # Returns True if the stack is empty else returns False
s . clear ()  # Clears the stack, and makes it empty
p = s . copy ()  # Creates a copy of stack as an independent object
print ( s )  # Prints the element of stacks as a stringified list
print ( repr ( s ))  # Returns the class object representation of the stack with the values it holds

隊列

 from stack import Queue
q = Queue ( 10 )  # Create a FIFO queue with queue length 6
q . enqueue ( 1 )  # Enqueues elements to the queue
q . enqueue ( 2 )
q . enqueue ( 3 )
q . dequeue ()  # Gets an element from the queue, pops it
q . list  # Returns the elements of queue as a list
q . front  # Returns the index of front pointer of the stack
q . rear  # Returns the index of rear pointer of the stack
q . list [ s . rear ] # Returns the value of the rear element
q . empty  # Returns True if the queue is empty else returns False
q . clear ()  # Clears the queue, and makes it empty
t = q . copy ()  # Creates a copy of stack as an independent object
print ( q )  # Prints the element of queue as a stringified list
print ( repr ( q ))  # Returns the class object representation of the queue with the values it holds 

貢獻

總是歡迎捐款！

• 叉這個存儲庫。
• 進行叉子回售的更改。
• 產生拉動請求。

請遵守GitHub的code of conduct 。

執照

Apache許可證2.0