数据结构-stack栈

# 栈的理解：后进先出，如果代码走完了，栈是空的，为True,否则为False

# 利用栈的原理进行括号的匹配
def cheak_kuohao(s):
    stack = []
    for char in s:
        if char in {'(','[','{'}:
            stack.append(char)
        elif char == ')':
            if len(stack) > 0 and stack[-1] == '(':
                stack.pop()
            else:
                return False
        elif char == ']':
            if len(stack) > 0 and stack[-1] == '[':
                stack.pop()
            else:
                return False
        elif char == '}':
            if len(stack) > 0 and stack[-1] == '{':
                stack.pop()
            else:
                return False
    if len(stack) == 0:
        return True
    else:
        return False

print(cheak_kuohao('{}{}[0[]]'))