<p>Given a string <code>expression</code> of numbers and operators, return <em>all possible results from computing all the different possible ways to group numbers and operators</em>. You may return the answer in <strong>any order</strong>.</p>

<p>The test cases are generated such that the output values fit in a 32-bit integer and the number of different results does not exceed <code>10<sup>4</sup></code>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> expression = &quot;2-1-1&quot;
<strong>Output:</strong> [0,2]
<strong>Explanation:</strong>
((2-1)-1) = 0 
(2-(1-1)) = 2
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> expression = &quot;2*3-4*5&quot;
<strong>Output:</strong> [-34,-14,-10,-10,10]
<strong>Explanation:</strong>
(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
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= expression.length &lt;= 20</code></li>
	<li><code>expression</code> consists of digits and the operator <code>&#39;+&#39;</code>, <code>&#39;-&#39;</code>, and <code>&#39;*&#39;</code>.</li>
	<li>All the integer values in the input expression are in the range <code>[0, 99]</code>.</li>
</ul>

class Solution:
    def diffWaysToCompute(self, expression: str) -> List[int]:
        #計算 expression 新增括號後的的所有可能值
        
        ans = []

        def get_combination(expr):
            #檢查字串是否只包含數字
            if expr.isdigit():
                return [expr] 

            temp=[]
            #這邊 i 代表走到第幾個數字
            for i , char in enumerate(expr):
                if char in "+-*":
                    #將運算子的左右拆開
                    l_exp = expr[:i]
                    r_exp = expr[i+1:]

                    #遞迴遍歷
                    l_com = get_combination(l_exp)
                    r_com = get_combination(r_exp)

                    for left in l_com:
                        for right in r_com:
                            temp.append(f"({left}{char}{right})")
            return temp
            
        all_com = get_combination(expression)
        print(all_com)
        
        for i in range(0,len(all_com)):
            ans.append(eval(all_com[i]))

        print(ans)
        return list(ans)

        
16800