Longest Valid Parentheses Java

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 static int longestValidParentheses(String s) {
        LinkedList<Integer> stack=new LinkedList<Integer>();
        int rst=0;
        for(int i=0;i<s.length();i++){
            if(s.charAt(i)=='(')
                stack.push(i);
            else{
                if(!stack.isEmpty()&&s.charAt(stack.peek())=='('){
                    stack.pop();
                    rst=Math.max(rst, stack.isEmpty()?i+1:i-stack.peek());
                }else {
                    stack.push(i);
                }
            }
        }
        return rst;
    }