본문 바로가기
알고리즘

리스트두개로 큐 만들어보기

by monsangter 2023. 4. 5.

 

 


class queue1:
  def __init__(self,s1):
    self.present = s1
    self.s2 = []

    for i in range(1,len(self.present)+1):
      self.s2.append(self.present[-i])
  
  def pop(self):
    self.present.remove(self.s2[-1])
    return self.s2.pop()

  def push(self,i):
    self.present.append(i)
    self.s2 = []

    for i in range(1,len(self.present)+1):
      self.s2.append(self.present[-i])

야매 큐

댓글