-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path1021. Remove Outermost Parentheses link
68 lines (58 loc) · 1.82 KB
/
1021. Remove Outermost Parentheses link
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
//https://leetcode.com/problems/remove-outermost-parentheses/
class Solution {
public:
string removeOuterParentheses(string s) {
vector<int> remove;
int c = 0;
remove.push_back(0);
for(int i = 0; i< s.size();++i){
if(s[i] == '(')
c++;
else
c--;
remove.push_back(c);
}
for(int i:remove)cout<<i<<" ";
string res="";
for(int i = 0; i< s.size();++i){
if(!((s[i] == '(' && remove[i]==0)||(s[i] == ')' && remove[i]==1)))
res+=s[i];
}
return res;
}
};
string stringToString(string input) {
assert(input.length() >= 2);
string result;
for (int i = 1; i < input.length() -1; i++) {
char currentChar = input[i];
if (input[i] == '\\') {
char nextChar = input[i+1];
switch (nextChar) {
case '\"': result.push_back('\"'); break;
case '/' : result.push_back('/'); break;
case '\\': result.push_back('\\'); break;
case 'b' : result.push_back('\b'); break;
case 'f' : result.push_back('\f'); break;
case 'r' : result.push_back('\r'); break;
case 'n' : result.push_back('\n'); break;
case 't' : result.push_back('\t'); break;
default: break;
}
i++;
} else {
result.push_back(currentChar);
}
}
return result;
}
int main() {
string line;
while (getline(cin, line)) {
string S = stringToString(line);
string ret = Solution().removeOuterParentheses(S);
string out = (ret);
cout << out << endl;
}
return 0;
}