What-is-stack.md

κ°œλ…

  • ν•œμͺ½ λμ—μ„œλ§Œ 자료λ₯Ό λ„£κ³  λΊ„ 수 μžˆλŠ” LIFO(Last In First Out) ν˜•μ‹μ˜ 자료 κ΅¬μ‘°μž…λ‹ˆλ‹€.

μ—°μ‚°

stackimage
  • POP : μŠ€νƒμ—μ„œ κ°€μž₯ μœ„μ— μžˆλŠ” ν•­λͺ©μ„ μ œκ±°ν•©λ‹ˆλ‹€.

  • PUSH : itemν•˜λ‚˜λ₯Ό μŠ€νƒμ˜ κ°€μž₯ μœ— 뢀뢄에 μΆ”κ°€ν•©λ‹ˆλ‹€.

  • PEEK : μŠ€νƒμ˜ κ°€μž₯ μœ„μ— μžˆλŠ” ν•­λͺ©μ„ λ°˜ν™˜ν•©λ‹ˆλ‹€.

κ΅¬ν˜„

  • python을 μ΄μš©ν•˜μ—¬ μ‚¬μš©ν•˜λŠ” 방법

# Shortcut functions for Stack in Python
stack = []
stack.append(1) #push
stack.pop() #pop
stack[-1] #peek 

# κ΅¬ν˜„
class Solution:
    stack = []
    def pop(self):
        behind_data = self.stack[-1]
        del stack[-1]
        return behind_data

    def push(self, item):
        return self.stack.insert(-1, item)

    def peek(self):
        return self.stack[-1]

    def isEmpty(self):
        if len(stack) == 0:
            return True
        else:
            return False

μ‚¬μš©

  • UNDO(Ctrl + Z) κΈ°λŠ₯

  • μ—­μˆœ λ¬Έμžμ—΄ λ§Œλ“€κΈ°

  • μˆ˜μ‹μ˜ κ΄„ν˜Έ 검사

  • μˆ˜μ‹ ν›„μœ„ν‘œκΈ°λ²ˆ λ°˜ν™˜ λ“±λ“± μ•„μ£Ό λ§ŽμŠ΅λ‹ˆλ‹€.

Last updated