Implement stack with Pyhon list

class Stack:
    '''Implement a stack using list'''
    def __init__(self, L=[]):
        self.data = L

    def push(self, item):
        self.data.append(item)

    def pop(self):
        return self.data.pop()

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

    def is_empty(self):
        return len(self.data) == 0

    def size(self):
        return len(self.data)

    def clear(self):
        self.data = []

if __name__ == '__main__':
    s = Stack()
    s.push(123)
    s.push('Hello')
    s.push(True)
    print('Size of s: ', s.size)
    print('Pop an item: ', s.pop())
    print('Peek an item:', s.peek())
    print('Size of s: ', s.size())
    print('Pop an item: ', s.pop())
    print('Pop an item: ', s.pop())
    print('Size of s: ', s.size())
    print('s is empty?: ', s.is_empty())
# Balanced Parentheses Using Stack data structure
from stack import Stack

def BalancedParentheses(strParens):
    s = Stack()
    for item in strParens:
        if item == '(':
            s.push(item)
        else:
            if s.is_empty():
                return False
            s.pop()

    return s.is_empty()

if __name__ == '__main__':
    print(BalancedParentheses('(()()()())'))
    print(BalancedParentheses('(((()))))'))
    print(BalancedParentheses('(()((())())))'))
    print(BalancedParentheses('(()()(()())))'))
# A more general brackets matching
from stack import Stack

def balancedSymbol(symStr):
    s = Stack()
    s.clear()   # I'm not sure why this is required 
    for item in symStr:
        if item in '([{':
            s.push(item)
        else:
            if s.is_empty():
                return False
            else:
                top = s.pop()
                if not match(top, item):
                    return False
    return s.is_empty()

def match(left, right):
    opening = '([{'
    closing = ')]}'
    return opening.index(left) == closing.index(right)


if __name__ == '__main__':
    print(balancedSymbol('(()[])'))         # Should be True
    print(balancedSymbol('(()[]){{'))       # Should be False
    print(balancedSymbol('({([])[]})'))     # Should be True
    print(balancedSymbol('(()[])[{}'))      # Should be False




  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值