Discover Packages
github.com/openset/leetcode
problems
different-ways-to-add-parentheses
package
Version:
v1.6.5
Opens a new window with list of versions in this module.
Published: Mar 23, 2021
License: MIT
Opens a new window with license information.
Imports: 0
Opens a new window with list of imports.
Imported by: 0
Opens a new window with list of known importers.
README
README
¶
< Previous
Next >
Given a string expression
of numbers and operators, return all possible results from computing all the different possible ways to group numbers and operators . You may return the answer in any order .
Example 1:
Input: expression = "2-1-1"
Output: [0,2]
Explanation:
((2-1)-1) = 0
(2-(1-1)) = 2
Example 2:
Input: expression = "2*3-4*5"
Output: [-34,-14,-10,-10,10]
Explanation:
(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
Constraints:
1 <= expression.length <= 20
expression
consists of digits and the operator '+'
, '-'
, and '*'
.
[Divide and Conquer ]
Similar Questions
Unique Binary Search Trees II (Medium)
Basic Calculator (Hard)
Expression Add Operators (Hard)
Expand ▾
Collapse ▴
Documentation
¶
There is no documentation for this package.
Source Files
¶
Click to show internal directories.
Click to hide internal directories.