使用Python实现高效的括号匹配检测

def is_valid(s: str) -> bool:
    stack = []
    mapping = {')': '(', ']': '[', '}': '{', '>': '<'}
    for char in s:
        if char in mapping.values():  # 左括号入栈
            stack.append(char)
        elif char in mapping.keys():  # 右括号匹配
            if stack and stack[-1] == mapping[char]:
                stack.pop()
            else:
                return False
    return not stack  # 栈空则匹配成功

# 提前排除明显错误情况
def bracket_mathch(one_str):
    if len(one_str) % 2 != 0:  # 奇数长度直接失败
        return False
    if one_str[0] in [')', ']', '}', '>']:  # 首字符为右括号
        return False

SYMBOLS = {'>': '<', ')': '(', ']': '[', '}': '{'}
def check(s):
    arr = []
    for c in s:
        if c in SYMBOLS.values():
            arr.append(c)
        elif c in SYMBOLS:
            if not arr or arr.pop() != SYMBOLS[c]:
                return False
    return not arr

test_cases = [
    "([)]",       # 失败：交叉嵌套
    "([{<>}])",   # 成功：多重嵌套
    "[[{}}]",     # 失败：花括号不匹配
    "",           # 成功：空字符串
    "({})[({})]"  # 成功：多重并列
]
for case in test_cases:
    print(f"{case}: {is_valid(case)}")

def is_valid_enhanced(s):
    stack = []
    mapping = {')': '(', ']': '[', '}': '{'}
    for char in s:
        if char in '([{':  # 左括号直接入栈
            stack.append(char)
        elif char in ')]}':
            if not stack or mapping[char] != stack.pop():
                return False
        # 非括号字符自动跳过
    return not stack

from concurrent.futures import ThreadPoolExecutor

def validate_chunks(text, chunk_size=1000):
    chunks = [text[i:i+chunk_size] for i in range(0, len(text), chunk_size)]
    with ThreadPoolExecutor() as executor:
        results = list(executor.map(is_valid, chunks))
    return all(results)