32. 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 int longestValidParentheses(String s) {
		int maxLen = 0;
		if (s == null || s.length() == 0) {
			return maxLen;
		}
		char[] chs = s.toCharArray();
		Stack<Integer> stack = new Stack<Integer>();
		for (int i = 0,len = s.length(); i < len; i++) {
			if (chs[i] == '(') {
				stack.push(i);
			} else {
				if (!stack.isEmpty()) {
					int top = stack.peek();
					if (chs[top] == '(') {
						stack.pop();
						if(stack.isEmpty()){
							maxLen = Math.max(maxLen, i+1);
						}else{
							maxLen = Math.max(maxLen, i-stack.peek());
						}
					} else {
						stack.push(i);
					}
				}else{
					stack.push(i);
				}
			}
		}
		
		return maxLen;

}