LeetCode 32. Longest Valid Parentheses

题目描述

出处 https://leetcode.com/problems/longest-valid-parentheses/

Given a string containing just the characters ‘(’ and ‘)’, find the length of the longest valid (well-formed) parentheses substring.

Example 1:

Input: “(()”
Output: 2
Explanation: The longest valid parentheses substring is “()”

Example 2:

Input: “)()())”
Output: 4
Explanation: The longest valid parentheses substring is “()()”

---

分析

这道题是要找出符合规范的最大字符串长度
方法一：使用动态规划的方法，时间复杂度O(n)，空间复杂度O(n)
若 s[i] = ‘)’ && s[i)-1] = ‘(’ 则 len[i] = len[i-2]+2
若 s[i] = ‘)’ && s[i-1] = ‘)’ && s[i-1-len[i-1]] = ‘(’ 则 len[i] = len[i-1]+2+len[i-1-len[i-1]-1]
最后取最大值即为结果

方法二：采用两次循环的方法，时间复杂度O(n)，空间复杂度O(1)
从前向后循环时，只需要考虑 ‘(’ 数量大于 ‘)’ 的情况，例如：((()
从后向前循环时，只需要考虑 ‘)’ 数量大于 ‘(’ 的情况，例如：()))
二者取最大值即为结果

---

最终结果

方法一：

class Solution {
public:
    int longestValidParentheses(string s) {
        int res = 0;
        vector<int> len(s.length(), 0);
        for (int i = 1; i < s.length(); i++) {
            if (s[i] == ')') {
                if (s[i-1] == '(') {
                    len[i] = (i>=2 ? len[i-2] : 0) + 2;
                } else if(i-len[i-1] > 0 && s[i-1-len[i-1]] == '(') {
                    len[i] = len[i-1] + 2 + ((i-len[i-1] > 0) ? len[i-2-len[i-1]] : 0);
                }
                
                res = max(res, len[i]);
            }
        }
        
        return res;
    }
};

方法二：

class Solution {
public:
    int longestValidParentheses(string s) {
        int res = 0;
        int left = 0, right = 0;
        for (int i = 0; i < s.length(); i++) {
           if (s[i] == '(') {
               left ++;
            } else {
                right ++;
            }
            if (left == right) {
                res = max(res, left+right);
            } else if (right > left) {
                left = right = 0;
            }
        }
        
        left = right = 0;
        for (int i = s.length()-1; i >= 0; i--) {
           if (s[i] == '(') {
               left ++;
            } else {
                right ++;
            }
            if (left == right) {
                res = max(res, left+right);
            } else if (right < left){
                left = right = 0;
            }
        }
        
        return res;
    }
};