[LeetCode] Longest Valid Parentheses, Solution

最新推荐文章于 2018-10-29 12:40:09 发布

原创最新推荐文章于 2018-10-29 12:40:09 发布 · 152 阅读

CC 4.0 BY-SA版权

本文介绍了一种算法，用于在给定只包含'('和')'字符的字符串中找到最长的有效括号子串。通过维护一个栈来跟踪可能的左边界，该算法能够高效地解决此问题。

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.

» Solve this problem

[Thoughts]
维护一个栈，每次维护上一个可能的左边际。

[Code]

1:       int longestValidParentheses(string s) {  
2:            const char* str = s.c_str();  
3:            int nMax=0;  
4:            const char *p = str;  
5:            vector<const char*> sta;  
6:            while(*p !='')  
7:            {  
8:                 if(*p == '(')  
9:                 {  
10:                      sta.push_back(p);                      
11:                 }  
12:                 else  
13:                 {  
14:                      if(!sta.empty() && *sta.back()=='(')  
15:                      {  
16:                           sta.pop_back();  
17:                           nMax = max(nMax, p-(sta.empty()?str-1:sta.back()));  
18:                      }  
19:                      else  
20:                      {  
21:                           sta.push_back(p);  
22:                      }  
23:                 }  
24:                 p++;  
25:            }  
26:            return nMax;  
27:       }