Longest Valid Parentheses

最新推荐文章于 2019-10-09 18:26:29 发布

最新推荐文章于 2019-10-09 18:26:29 发布 · 88 阅读

leetcode 专栏收录该内容

193 篇文章

订阅专栏

本文介绍了一个算法，用于找到给定字符串中由'('和')'组成的最长有效括号子串。通过使用栈来跟踪括号状态，实现高效求解。

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() == 0) {
        	return 0;
        }
        Stack<Integer> stack = new Stack<Integer>();
        int start = 0;
        int res = 0;
        for (int i = 0; i < s.length(); i++) {
			if (s.charAt(i) == '(') {
				stack.push(i);
			} else {
				if (stack.isEmpty()) {
					start = i + 1;
				} else {
					stack.pop();
					if (stack.isEmpty()) {
						res = Math.max(res, i-start+1); 
					} else {
						res = Math.max(res, i-stack.peek());
					}
				}
			}
		}
        return res;
    }
}