刷题总结#9

#241. Different Ways to Add Parentheses
Given a string of numbers and operators, return all possible results from computing all the different possible ways to group numbers and operators. The valid operators are +, - and *.
Input: “2*3-4*5”
(2*(3-(4*5))) = -34
((2*3)-(4*5)) = -14
((2*(3-4))*5) = -10
(2*((3-4)*5)) = -10
(((2*3)-4)*5) = 10
Output: [-34, -14, -10, -10, 10]
这道题采用递归的思想，遇到一个符号，把左右两边想成一个整体，就是加一个括号，然后就变成了子问题。
class Solution {
public:
vector diffWaysToCompute(string input) {
vector result;
int size = input.size();
for (int i = 0; i < size; i++) {
char cur = input[i];
if (cur == ‘+’ || cur == ‘-’ || cur == ‘*’) {
// Split input string into two parts and solve them recursively
vector result1 = diffWaysToCompute(input.substr(0, i));
vector result2 = diffWaysToCompute(input.substr(i+1));
for (auto n1 : result1) {
for (auto n2 : result2) {
if (cur == ‘+’)
result.push_back(n1 + n2);
else if (cur == ‘-‘)
result.push_back(n1 - n2);
else
result.push_back(n1 * n2);
}
}
}
}
// if the input string contains only number
if (result.empty())
result.push_back(atoi(input.c_str()));
return result;
}
};

值得学习的是
1.input.substr(0, i) 下标0<=x