<p>Given a string <code>num</code> that contains only digits and an integer <code>target</code>, return <em><strong>all possibilities</strong> to insert the binary operators </em><code>&#39;+&#39;</code><em>, </em><code>&#39;-&#39;</code><em>, and/or </em><code>&#39;*&#39;</code><em> between the digits of </em><code>num</code><em> so that the resultant expression evaluates to the </em><code>target</code><em> value</em>.</p>

<p>Note that operands in the returned expressions <strong>should not</strong> contain leading zeros.</p>

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

<pre>
<strong>Input:</strong> num = &quot;123&quot;, target = 6
<strong>Output:</strong> [&quot;1*2*3&quot;,&quot;1+2+3&quot;]
<strong>Explanation:</strong> Both &quot;1*2*3&quot; and &quot;1+2+3&quot; evaluate to 6.
</pre>

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

<pre>
<strong>Input:</strong> num = &quot;232&quot;, target = 8
<strong>Output:</strong> [&quot;2*3+2&quot;,&quot;2+3*2&quot;]
<strong>Explanation:</strong> Both &quot;2*3+2&quot; and &quot;2+3*2&quot; evaluate to 8.
</pre>

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

<pre>
<strong>Input:</strong> num = &quot;3456237490&quot;, target = 9191
<strong>Output:</strong> []
<strong>Explanation:</strong> There are no expressions that can be created from &quot;3456237490&quot; to evaluate to 9191.
</pre>

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

<ul>
	<li><code>1 &lt;= num.length &lt;= 10</code></li>
	<li><code>num</code> consists of only digits.</li>
	<li><code>-2<sup>31</sup> &lt;= target &lt;= 2<sup>31</sup> - 1</code></li>
</ul>

class Solution:
    def addOperators(self, num: str, target: int) -> List[str]:
        nums = list(num)
        combinations = []
        adds = ['-', '+', '*', '']
        for i in nums:
            if len(combinations) == 0:
                combinations.append([i, int(i)])
                continue
            cp_comb = []
            for cmb in combinations:
                for add in adds:
                    val = copy.copy(cmb)
                    val[0] = val[0] + add
                    cp_comb.append(val)
            #print('--', cp_comb)
            for ind in range(len(cp_comb)):
                cp_comb[ind][0] = cp_comb[ind][0] + i
            #print('**', cp_comb)
            combinations = cp_comb
            #break
        combinationsn = []
        for i in combinations:
            if re.compile('[*+-]0[0-9]+|^0+[0-9]+').findall(i[0]):
                continue 
            combinationsn.append(i)
        combinationsn = [[i[0], eval(i[0])] for i in combinationsn]
        combinationsn = list(filter(lambda x: x[1] == target, combinationsn))
        #print('++++', combinations) 
        return [i[0] for i in combinationsn]
        
93000