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" Output: [0, 2] Explanation: ((2-1)-…

public class Solution { public IList<int> DiffWaysToCompute(string input) { List<int> ret = new List<int>(); ; i < input.Length; i++) { if (input[i] == '-' || input[i] == '*' || input[i] == '+') { , i); ); var part1Ret = DiffWaysToCom…

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: …

class Solution(object): def diffWaysToCompute(self, input): """ :type input: str :rtype: List[int] """ #一个函数calc做运算, #一个字典memo记录已经有的结果,key为输入字符串,value为所有计算结果组合 #遍历input,以一个运算符为界,对左右两边进行计算,得到所有组合后返回,并进行排列组合计算 #递归边界为input为数字 if…

给定一个含有数字和运算符的字符串,为表达式添加括号,改变其运算优先级以求出不同的结果.你需要给出所有可能的组合的结果.有效的运算符号包含 +, - 以及 * . 示例 1: 输入: "2-1-1" 输出: [0, 2] 解释: ((2-1)-1) = 0 (2-(1-1)) = 2 示例 2: 输入: "2*3-4*5" 输出: [-34, -14, -10, -10, 10] 解释: (2*(3-(4*5))) = -34 ((2*3)-(4*5)) = -14…