首页 > 代码库 > Longest Valid Parentheses
Longest Valid Parentheses
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.
答案
public class Solution {
public int longestValidParentheses(String s) {
if(s==null||s.length()<=1)
{
return 0;
}
char []array=s.toCharArray();
int i=0;
int j=0;
int result=0;
for(j=1;j<array.length;j++)
{
if(array[j]==')')
{
if(i>=0&&array[i]=='(')
{
array[i]=0;
array[j]=0;
while(i>=0&&array[i]==0)
{
i--;
}
result=Math.max(result,j-i);
continue;
}
}
i=j;
}
return result;
}
}Longest Valid Parentheses
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。