leetcode

0 class Solution {

1 public:

2 string reverseParentheses(string s) const {

3 stack<int> st;

4 for (int i = 0; i < s.size(); i++) {

5 if (s[i] == '(')

6 st.push(i);

7 else if (s[i] == ')') {

8 reverse(begin(s) + st.top(), begin(s) + i);

9 st.pop();

10 }

11 }

12

13 int size = 0;

14 for (int i = 0; i < s.size(); i++)

15 if (s[i] != '(' && s[i] != ')') s[size++] = s[i];

16 s.resize(size);

17

18 return s;

19 }

20 };