stack.py
1.0.0
Stack.py는 Python의 Lifo Stack & Fifo 큐 구현입니다. 다른 데이터 유형은 아니지만 하나로 취급 할 수 있습니다.
Lifo- 마지막으로, 먼저 . 들어가야 할 마지막 요소가 가장 먼저 나올 것입니다.
FIFO- 먼저, 먼저 . 들어가는 첫 번째 요소는 가장 먼저 나가는 것입니다.
제공 : Shields.io
가장 쉬운 방법은 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 준수하십시오.
아파치 라이센스 2.0
