mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 19:53:12 +08:00
38 lines
1.4 KiB
HTML
38 lines
1.4 KiB
HTML
<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> </p>
|
|
<p><strong class="example">Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> expression = "2-1-1"
|
|
<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 = "2*3-4*5"
|
|
<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> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>1 <= expression.length <= 20</code></li>
|
|
<li><code>expression</code> consists of digits and the operator <code>'+'</code>, <code>'-'</code>, and <code>'*'</code>.</li>
|
|
<li>All the integer values in the input expression are in the range <code>[0, 99]</code>.</li>
|
|
<li>The integer values in the input expression do not have a leading <code>'-'</code> or <code>'+'</code> denoting the sign.</li>
|
|
</ul>
|