Leetcode 032 Longest Valid Parentheses（DP）

题目连接：Leetcode 032 Longest Valid Parentheses

解题思路：动态规划，dp[i]表示以i结尾，最长的合法串长度。只有s[i]为右括号时，dp[i]才可能不为0，如果s[i]为左括号时，dp[i]一定为0。dp[i-2] + "()"，"(" + dp[i-1] + ")"。 

class Solution {
	public:
		int longestValidParentheses(string s) {
			int ans = 0;
			int* dp = new int[s.size() + 1];

			dp[0] = 0;
			for (int i = 1; i <= s.size(); i++) {
				dp[i] = 0;

				if (s[i-1] == ')') {
					int l = i - dp[i-1] - 1;
					if (l >= 0 && s[l-1] == '(') dp[i] = max(dp[i], dp[l-1] + dp[i-1] + 2);

					int r = i - 1;
					if (r >= 0 && s[r-1] == '(') dp[i] = max(dp[i], dp[i-2] + 2);
				}
				ans = max(ans, dp[i]);
			}

			delete dp;
			return ans;
		}
};