Redian新闻
>
LeetCode LongestValidParentheses
avatar
LeetCode LongestValidParentheses# JobHunting - 待字闺中
f*i
1
/*Given a string containing just the characters '(' and ')', find the length
of the longest valid (well-formed) parentheses substring.
* For "(()", the longest valid parentheses substring is "()", which
has length = 2.
* Another example is ")()())", where the longest valid parentheses
substring is "()()", which has length = 4.
* */
请问有没有好解法。多谢
avatar
p*2
2
dp
avatar
h*3
3
不是有人说了左扫描一遍,右扫描一遍就可以了吗?
avatar
f*i
4
怎么dp,能不能展开说说。
相关阅读
logo
联系我们隐私协议©2024 redian.news
Redian新闻
Redian.news刊载任何文章,不代表同意其说法或描述,仅为提供更多信息,也不构成任何建议。文章信息的合法性及真实性由其作者负责,与Redian.news及其运营公司无关。欢迎投稿,如发现稿件侵权,或作者不愿在本网发表文章,请版权拥有者通知本网处理。