<p>You are given a string <code>s</code> that consists of lower case English letters and brackets.</p>

<p>Reverse the strings in each pair of matching parentheses, starting from the innermost one.</p>

<p>Your result should <strong>not</strong> contain any brackets.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> s = &quot;(abcd)&quot;
<strong>Output:</strong> &quot;dcba&quot;
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> s = &quot;(u(love)i)&quot;
<strong>Output:</strong> &quot;iloveu&quot;
<strong>Explanation:</strong> The substring &quot;love&quot; is reversed first, then the whole string is reversed.
</pre>

<p><strong class="example">Example 3:</strong></p>

<pre>
<strong>Input:</strong> s = &quot;(ed(et(oc))el)&quot;
<strong>Output:</strong> &quot;leetcode&quot;
<strong>Explanation:</strong> First, we reverse the substring &quot;oc&quot;, then &quot;etco&quot;, and finally, the whole string.
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= s.length &lt;= 2000</code></li>
	<li><code>s</code> only contains lower case English characters and parentheses.</li>
	<li>It is guaranteed that all parentheses are balanced.</li>
</ul>

class Solution {
public:
    string reverseParentheses(string s) {
        stack<string>st;
        int n=s.size();
        int c=0,i=0;
        string res="";
        while(i<n and s[i]!='(' and s[i]!=')'){
            res+=s[i];
            i+=1;
        }
        while(i<n){
            if(s[i]=='('){
                c+=1;
                st.push("(");
            }
            else if(s[i]==')'){
                string x="";
                if(c%2!=0){
                    while(st.top()!="("){
                        x+=st.top();
                        st.pop();
                    }
                }
                else{
                    while(st.top()!="("){
                        if(x==""){
                            x+=st.top();
                        }
                        else{
                            x=st.top()+x;
                        }
                        st.pop();
                    }
                }
                cout<<x<<endl;
                c-=1;
                st.pop();
                st.push(x);
            }
            else{
                string x="";
                x+=s[i];
                st.push(x);
            }
            i+=1;
        }
        string x;
        while(!st.empty()){
            if(x==""){
                x+=st.top();
            }
            else{
                x=st.top()+x;
            }
            st.pop();
        }
        res+=x;
        return res;
    }
};
11200