- 问题描述:
- 实现方式:
- result:
问题描述:实现方式:给你一个只包含 '(' 和 ')' 的字符串,找出最长有效(格式正确且连续)括号子串的长度。
示例 1:
输入:s = "(()" 输出:2 解释:最长有效括号子串是 "()"示例 2:
输入:s = ")()())" 输出:4 解释:最长有效括号子串是 "()()"示例 3:
输入:s = "" 输出:0
def theLongestValidBracket(s):
flag = 0
element = list(s)
lid = []
rid = []
couple = []
for id, ele in enumerate(element):
if ele == "(":
lid.append(id)
else:
rid.append(id)
for l in lid:
for r in rid:
if r > l:
couple.append((l,r))
rid.remove(r)
break
print(couple)
return couple[-1][1]-couple[0][0]
print(theLongestValidBracket("))()))(()))(()("))
result:
[(2, 3), (6, 8), (7, 9), (11, 13)] 11 Process finished with exit code 0



