1
class Solution {
2
public:
3
stack<char> p;
4
int count = 0;
5
string removeOuterParentheses(string s) {
6
string ans = {};
7

8
for (auto &i : s) {
9
if (i == '(' && count == 0) {
10
p.push(i);
11
count++;
12
} else if (i == '(' && count != 0) {
13
ans += '(';
14
p.push(i);
15
count++;
16
} else {
17
count--;
18
p.pop();
19
if (count > 0) ans += ')';
20
}
21
}
22
return ans;
23
}
24
};

0

WPM •0 •0

100%

ACC •0 •0

0s

TIME •0