32 Longest Valid Parentheses

32. Longest Valid Parentheses

def longestValidParentheses(s: str)->bool:
    result = 0
    start = 0
    stk = []
    length = len(s)
    for i in range(length):
        if s[i] == "(": # 用栈记录左括号的下标
            stk.append(i)
        else: # s[i] == ")"
            if len(stk)==0: # 栈为空->目前没有遇到左括号,比如 )()()
                start = i + 1
            else:
                stk.pop() # 栈顶（栈顶元素为，最近期入栈的左括号的下标）
                if len(stk)==0: # ()()
                    result = max(result, (i-start)+1)
                else: # 所遇的左括号多于右括号，比如 (()()
                    pos = stk[-1] # pos是未被匹配右括号的左括号的下标
                    result = max(result, i-pos)
    return result

result = longestValidParentheses("())()")
print("result = ",result)

添加链接描述