class Solution:
def longestValidParentheses(self, s: str) -> int:
if not s:return 0
result=[]
stack=[]
for i in range(len(s)):
if s[i] == '(':
stack.append(i)
if s[i] == ')' and stack:
result.append(stack.pop())
result.append(i)
result.sort()
solution_left=0
solution=0
for i in range(len(result))[1:]:
if result[i]-result[i-1]==1:
solution=max(i-solution_left+1,solution)
else:
solution_left=i
return solution
又是一道关于括号的题目,用栈是真的方便而且很好理解