1
class Solution {
2
 public:
3
  string reverseParentheses(string s) {
4
    stack<int> st;
5
    for (int i = 0; i < s.size(); i++) {
6
      if (s[i] == '(') {
7
        st.push(i);
8
      } else if (s[i] == ')') {
9
        int strt = st.top();
10
        strt = strt + 1;
11
        int end = i;
12
        reverse(s.begin() + strt, s.begin() + end);
13
        st.pop();
14
      }
15
    }
16
    string ans = "";
17
    for (int i = 0; i < s.size(); i++) {
18
      if (s[i] == '(' || s[i] == ')') {
19
        continue;
20
      }
21
      ans += s[i];
22
    }
23
    return ans;
24
  }
25
};