Linked Stack in Python

5 篇文章 0 订阅

1. Node

class Node:
    def __init__(self, data):
        self.data = data
        self.next = None

    def __str__(self):
        return str(self.data)
    
    def __eq__(self, data):
        return self.data == data

2. Stack

class Stack:
    def __init__(self):
        self.size = 0
        self.top = None
    
    def push(self, data):
        n = Node(data)
        if self.top:
            n.next = self.top
        self.top = n
        self.size += 1
    
    def peek(self):
        return self.top if not self.empty() else None
    
    def pop(self):
        ptr = None
        if not self.empty():
            ptr = self.top
            self.top = ptr.next
            self.size -= 1
        return ptr       
    
    def empty(self):
        return self.size == 0
    
    def size(self):
        return self.size
    
    def traverse(self):
        print(f"The current length: {self.size}")
        for val in self.iter():
            print(val)
    
    def iter(self):
        ptr = self.top
        while ptr:
            val = ptr.data
            ptr = ptr.next
            yield val

3. Test Codes

def test_stack():
    s = Stack()
    s.push("eggs")
    s.push("ham")
    s.push("spam")
    
    print('-' * 15)
    s.traverse()
    
    print('-' * 15)
    p = s.pop()
    s.traverse()
    
    while not s.empty():
        ptr = s.pop()
        if ptr:
            print(ptr, " is poped.")
        s.traverse()

4. Case: bracket matching check

def check_brackets_match(sent):
    match = True
    s = Stack()
    for c in sent:
        if c in "([{":
            s.push(c)
        elif c in ")]}":
            top_c = s.pop()             
            if (top_c == '(' and c == ')') or \
               (top_c == '[' and c == ']') or \
               (top_c == '{' and c == '}'):
                continue
            else:
                match = False
                break
    return s.empty() and match
 

if __name__ == '__main__':
    # test_stack()

    sl = (
        "{(foo)(bar)}[hello](((this)is)a)test",
        "{(foo)(bar)}[hello](((this)is)atest",
        "{(foo)(bar)}[hello](((this)is)a)test))"
    )

    for s in sl:
        ret = check_brackets_match(s)
        print(f"{s}: {ret}")
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

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

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值