Python UnorderedList.pop 예제들

예제 #1

파일: deque.py 프로젝트: overide/Datastructure-and-Algorithm-with-Python

class Deque:

	def __init__(self):
		self.dq = UnorderedList()

	def add_rear(self,item):
		self.dq.add(item)

	def add_front(self,item):
		self.dq.append(item)

	def remove_rear(self):
		return self.dq.pop(0)

	def remove_front(self):
		return self.dq.pop()

	def size(self):
		return self.dq.size()

	def is_empty(self):
		return self.dq.is_empty()

	def show(self):
		print(self.dq)

예제 #2

class Deque:
    def __init__(self):
        self.dq = UnorderedList()

    def add_rear(self, item):
        self.dq.add(item)

    def add_front(self, item):
        self.dq.append(item)

    def remove_rear(self):
        return self.dq.pop(0)

    def remove_front(self):
        return self.dq.pop()

    def size(self):
        return self.dq.size()

    def is_empty(self):
        return self.dq.is_empty()

    def show(self):
        print(self.dq)

예제 #3

파일: queue.py 프로젝트: overide/Datastructure-and-Algorithm-with-Python

class Queue:

	def __init__(self):
		self.q = UnorderedList()

	def enque(self,items):
		self.q.add(items)

	def deque(self):
		return self.q.pop()

	def size(self):
		return self.q.size()

	def is_empty(self):
		return self.q.is_empty()

	def show(self):
		print(self.q)

예제 #4

class Stack:
    def __init__(self):
        self.s = UnorderedList()

    def push(self, items):
        self.s.add(items)

    def pop_stack(self):
        return self.s.pop(0)

    def peek_stack(self):
        return self.s.head.get_data()

    def is_empty(self):
        return self.s.is_empty()

    def size(self):
        return self.s.size()

    def show(self):
        print(self.s)