본문 바로가기
자료구조

Stack

by aqua_marri 2024. 10. 28.
class Stack:
    def __init__(self):
        self.s = []
        
    def push(self, item):
        self.s.append(item)
        
    def isEmpty(self):
        return len(self.s) == 0
    
    def pop(self):
        if self.isEmpty() == False:
            return self.s.pop(-1)	
        else:
            return None
    
    def peek(self):
        if self.isEmpty() == False:
            return self.s[-1]
        else:
            return None

'자료구조' 카테고리의 다른 글

Factorial, Fibonacci  (0) 2024.10.28
Queue  (0) 2024.10.28
Transpose of Sparse Matrix  (0) 2024.10.28
Circle Linked List  (0) 2024.10.28
Single Linked List  (0) 2024.10.28