<p>Given a string <code>s</code> containing only three types of characters: <code>&#39;(&#39;</code>, <code>&#39;)&#39;</code> and <code>&#39;*&#39;</code>, return <code>true</code> <em>if</em> <code>s</code> <em>is <strong>valid</strong></em>.</p>

<p>The following rules define a <strong>valid</strong> string:</p>

<ul>
	<li>Any left parenthesis <code>&#39;(&#39;</code> must have a corresponding right parenthesis <code>&#39;)&#39;</code>.</li>
	<li>Any right parenthesis <code>&#39;)&#39;</code> must have a corresponding left parenthesis <code>&#39;(&#39;</code>.</li>
	<li>Left parenthesis <code>&#39;(&#39;</code> must go before the corresponding right parenthesis <code>&#39;)&#39;</code>.</li>
	<li><code>&#39;*&#39;</code> could be treated as a single right parenthesis <code>&#39;)&#39;</code> or a single left parenthesis <code>&#39;(&#39;</code> or an empty string <code>&quot;&quot;</code>.</li>
</ul>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<pre><strong>Input:</strong> s = "()"
<strong>Output:</strong> true
</pre><p><strong class="example">Example 2:</strong></p>
<pre><strong>Input:</strong> s = "(*)"
<strong>Output:</strong> true
</pre><p><strong class="example">Example 3:</strong></p>
<pre><strong>Input:</strong> s = "(*))"
<strong>Output:</strong> true
</pre>
<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= s.length &lt;= 100</code></li>
	<li><code>s[i]</code> is <code>&#39;(&#39;</code>, <code>&#39;)&#39;</code> or <code>&#39;*&#39;</code>.</li>
</ul>

class Solution {
public:
    //int dp[101][101]={-1};

    bool dfs(string &s, int i, int open,    vector<vector<int>> &dp) {
        if (open < 0) return 0;
        if (i == s.length()) return open == 0;
        if (dp[i][open] != -1) return dp[i][open];
        if (s[i] == '(') return dp[i][open] = dfs(s, i + 1, open + 1, dp);
        if (s[i] == ')') return dp[i][open] = dfs(s, i + 1, open - 1, dp);      
        return dp[i][open] = dfs(s, i + 1, open + 1, dp) || dfs(s, i + 1, open - 1, dp) || dfs(s, i + 1, open, dp);
    }
    
    bool checkValidString(string s) {
        //memset(dp, -1, sizeof(dp));
        vector<vector<int>> dp(101, vector<int>(101, -1));
        return dfs(s, 0, 0, dp);
    }
};
12380