[leetcode] 241. Different Ways to Add Parentheses @ python

原题

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)-1) = 0
(2-(1-1)) = 2
Example 2:

Input: “23-45”
Output: [-34, -14, -10, -10, 10]
Explanation:
(2*(3-(45))) = -34
((23)-(45)) = -14
((2(3-4))5) = -10
(2((3-4)5)) = -10
(((23)-4)*5) = 10

解法

参考: Python easy to understand solution (divide and conquer).
Divide and conquer + 递归. Base case是当input不含操作符时, 直接返回数字即可. 然后遍历input, 每次遇到操作符时, 对操作符左边和右边的字符串递归求解, 然后将两边的结果进行运算即可.

代码

class Solution(object):
    def diffWaysToCompute(self, input):
        """
        :type input: str
        :rtype: List[int]
        """
        # base case
        if input.isdigit():
            return [int(input)]
        
        res = []
        for i in range(len(input)):
            if input[i] in '+-*':
                res1 = self.diffWaysToCompute(input[:i])
                res2 = self.diffWaysToCompute(input[i+1:])
                for m in res1:
                    for n in res2:
                        res.append(self.helper(m, n, input[i]))
                        
        return res               
        
    
    def helper(self, m, n, op):
        if op == '+':
            return m+n
        if op == '-':
            return m-n
        if op == '*':
            return m*n