admin管理员组

文章数量:1636925

Implement Stack

Description:

Implement a stack. You can use any data structure inside a stack except stack itself to implement it.

Example
push(1)
pop()
push(2)
top() // return 2
pop()
isEmpty() // return true
push(3)
isEmpty() // return false

Code:

class Stack:
    stack = []
    """
    @param: x: An integer
    @return: nothing
    """
    def push(self, x):
        # write your code here
        self.stack.append(x)
    """
    @return: nothing
    """

    def pop(self):
        # write your code here
        return self.stack.pop()
    """
    @return: An integer
    """
    def top(self):
        # write your code here
        return self.stack[-1]
    """
    @return: True if the stack is empty
    """
    def isEmpty(self):
        # write your code here
        if self.stack:
            return False
        else:
            return True

本文标签： implementLintcodePythonEasyStack

版权声明：本文标题：Lintcode 495. Implement Stack (Easy) (Python) 内容由热心网友自发贡献，该文观点仅代表作者本人， 转载请联系作者并注明出处：https://www.elefans.com/dianzi/1729234468a1191835.html， 本站仅提供信息存储空间服务，不拥有所有权，不承担相关法律责任。如发现本站有涉嫌抄袭侵权/违法违规的内容，一经查实，本站将立刻删除。