算法 之 有限状态自动机

这道题是从leetcode longest valid parentheses想到的
但是其实这道题和DMA的关系也不是很大…
先贴代码吧

class Solution {
public:
    int longestValidParentheses(string s) {
        int len = s.length();
        int maxlen = 0;
        int cnt = 0;
        int tmplen = 0;
        for(int i = 0; i < len; ++i){
            if(s[i] == '('){
                ++cnt;
                tmplen++;
            }
            else if(s[i] == ')'){
                if(cnt <= 0){
                    //unmatched
                    cnt = 0;
                    tmplen = 0;
                }
                else{
                    cnt--;
                    tmplen++;
                    maxlen = max(maxlen, tmplen);
                }
            }
        }
        return maxlen;
    }
};

在网上找到了一种一维dp, 不用stack的方法,还是很巧妙的

public int longestValidParentheses(String s) {
    if (s.length() == 0)
        return 0;
    int maxLen = 0;
    int[] d = new int[s.length()];
    // d[i] means substring starts with i has max valid lenth of d[i]
    d[s.length() - 1] = 0;
    for (int i = s.length() - 2; i >= 0; i--) {
        if (s.charAt(i) == ')')
            d[i] = 0;
        else {
            int j = (i + 1) + d[i + 1];
            if (j < s.length() && s.charAt(j) == ')') {
                d[i] = d[i + 1] + 2; //(()())的外包情况
                if (j + 1 < s.length())
                    d[i] += d[j + 1];//()()的后面还有的情况
            }
        }
        maxLen = Math.max(maxLen, d[i]);
    }
    return maxLen;
}