摘要： int longestValidParentheses(string s) { int l = 0, r = 0, ans = 0; for (int i = 0; i < s.length(); i++) { if (s[i] == '(')l++; else r++; if (r > l)l = 阅读全文