LeetCode241. Different Ways to Add Parentheses

LeetCode241. 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 *.

Example 1

Input: "2-1-1".

((2-1)-1) = 0
(2-(1-1)) = 2

Output: [0, 2]

Example 2

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]

题意分析：由于我选择的是分而治之的题目，所以一开始想的时候就是往分治的方向去考虑。通过分析的时候，我发现符号是一个分界点。

举个例子： a + b - c * d

当遇到+的时候，我们把左边的分一个LeftSide， 右边分为RightSide。符号为操作符。

于是递归大概就是 result = LeftSide [op] RightSide。

代码：

class Solution {
public:
	vector<int> diffWaysToCompute(string input) {
		int flag = 1;
		for (auto i : input) {
			if (i == '-' || i == '+' || i == '*') {
				flag = 0;
				break;
			}
		}
		if (flag)
			return{ stoi(input) };
		vector<int> res;
		for (int i = 0; i < input.size(); i++) {
			if (input[i] == '-' || input[i] == '+' || input[i] == '*') {
				vector<int> a = diffWaysToCompute(input.substr(0, i));
				vector<int> b = diffWaysToCompute(input.substr(i + 1));
				/*for (auto k : process(input[i], a, b)) {
					result.push_back(k);
				}*/
				if (input[i] == '-') {
					for (int k = 0; k < a.size(); k++) {
						for (int j = 0; j < b.size(); j++) {
							res.push_back(a[k] - b[j]);
						}
					}
				}
				else if (input[i] == '+') {
					for (int k = 0; k < a.size(); k++) {
						for (int j = 0; j < b.size(); j++) {
							res.push_back(a[k] + b[j]);
						}
					}
				}
				else {
					for (int k = 0; k < a.size(); k++) {
						for (int j = 0; j < b.size(); j++) {
							res.push_back(a[k] * b[j]);
						}
					}
				}
			}
		}
		sort(res.begin(), res.end());
		return res;
	}
};