Python LinkedList.add_to_head示例

示例#1

文件： stack.py 项目： avawing/Data-Structures

class Stack:
    def __init__(self):
        self.size = 0
        self.storage = LinkedList()

    def __len__(self):
        return self.size

    def push(self, value):
        self.size += 1
        self.storage.add_to_head(value)

    def pop(self):
        self.size -= 1
        self.storage.remove_tail()

示例#2

class Stack:
    def __init__(self):
        self.__storage = LinkedList()

    def __len__(self):
        return self.size

    def push(self, value):
        self.__storage.add_to_head(value)

    def pop(self):
        return self.__storage.remove_head()

    @property
    def size(self) -> int:
        return len(self.__storage)

示例#3

文件： stack.py 项目： brianna-keune-cs/Data-Structures

class Stack:
    def __init__(self):
        self.storage = LinkedList()

    def __len__(self):
        return len(self.storage)

    def push(self, value):
        self.storage.add_to_head(value)

    def pop(self):
        try:
            removed = self.storage.remove_head()
            return removed
        except:
            return None

示例#4

文件： stack.py 项目： chazkiker2/Data-Structures

class Stack:
    def __init__(self, size=0):
        self.size = size
        self.storage = LinkedList()

    def __len__(self):
        return self.size

    def push(self, value):
        self.size += 1
        # current.storage.add_to_tail(key)
        self.storage.add_to_head(value)
        # print(current.storage.head.key)

    def pop(self):
        if self.size == 0:
            return
        self.size -= 1
        # return current.storage.remove_tail()
        # print(current.storage.head.key)
        return self.storage.remove_head()