【Leeetcode】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.

Java:

这次大神描述的不是很清楚。其实就是分进入的是左括号还是右括号两种情况，

1. 如果是（，push。

2. 如果是）2.1 栈空就移位；2.2 如果是栈不空,肯定是有（，所以就pop。2.2.1pop空就i-start+1;2.2.2pop不空就i-peek.

public class Solution {
    public int longestValidParentheses(String s) {
       if(s==null||s.length()==0) return 0;
       LinkedList<Integer> stack= new LinkedList<Integer>();
       int max=0;
       int start=0;
       for(int i=0;i<s.length();i++)
       {
           if(s.charAt(i)=='(')//stack only push "(" 
           {
               stack.push(i);
           }
           else{
               if(stack.isEmpty())//when meet ")", move forward
               {
                   start=i+1;
               }
               else{
                   stack.pop();
               max=stack.isEmpty()?Math.max(max,i-start+1):Math.max(max,i-stack.peek());
               }
           }
       }
       return max;
    }
}