-
Notifications
You must be signed in to change notification settings - Fork 119
/
Copy pathDifferent Ways to Add Parentheses.cpp
56 lines (53 loc) · 1.61 KB
/
Different Ways to Add Parentheses.cpp
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
class Solution {
public:
int stoi1(string &s, int i, int j)
{
int num = 0;
for (int k = i; k <= j; k++)
{
num = num * 10 + (s[k] - '0');
}
return num;
}
vector<int> rec(string &s, int i, int j, vector<vector<vector<int>>> &dp)
{
if(dp[i][j].size() > 0){
return dp[i][j];
}
vector<int> ans;
for (int k = i; k <= j; k++)
{
if(s[k] == '+' || s[k] == '*' || s[k] == '-'){
vector<int> v1 = rec(s, i, k - 1, dp);
vector<int> v2 = rec(s, k + 1, j, dp);
for (int m = 0; m < v1.size(); m++)
{
for (int n = 0; n < v2.size(); n++)
{
if (s[k] == '-')
{
ans.push_back(v1[m] - v2[n]);
}
else if (s[k] == '*')
{
ans.push_back(v1[m] * v2[n]);
}
else
{
ans.push_back(v1[m] + v2[n]);
}
}
}
}
}
if(ans.empty()){
ans.push_back(stoi1(s,i,j));
}
return dp[i][j] = ans;
}
vector<int> diffWaysToCompute(string expression) {
int n = expression.length() + 1;
vector<vector<vector<int>>> dp(n, vector<vector<int>>(n, vector<int>()));
return rec(expression, 0, expression.length()-1, dp);
}
};