|
| 1 | +/** |
| 2 | + * 282. Expression Add Operators |
| 3 | + * https://leetcode.com/problems/expression-add-operators/ |
| 4 | + * Difficulty: Hard |
| 5 | + * |
| 6 | + * Given a string num that contains only digits and an integer target, return all possibilities |
| 7 | + * to insert the binary operators '+', '-', and/or '*' between the digits of num so that the |
| 8 | + * resultant expression evaluates to the target value. |
| 9 | + * |
| 10 | + * Note that operands in the returned expressions should not contain leading zeros. |
| 11 | + */ |
| 12 | + |
| 13 | +/** |
| 14 | + * @param {string} num |
| 15 | + * @param {number} target |
| 16 | + * @return {string[]} |
| 17 | + */ |
| 18 | +var addOperators = function(num, target) { |
| 19 | + const result = []; |
| 20 | + backtrack('', 0, 0, 0); |
| 21 | + return result; |
| 22 | + |
| 23 | + function backtrack(expression, sum, prev, start) { |
| 24 | + if (start === num.length && sum === target) { |
| 25 | + result.push(expression); |
| 26 | + return; |
| 27 | + } |
| 28 | + for (let i = start, str = ''; i < num.length; i++) { |
| 29 | + str += num[i]; |
| 30 | + const n = Number(str); |
| 31 | + if (!start) { |
| 32 | + backtrack(str, n, n, i + 1); |
| 33 | + if (str === '0') return; |
| 34 | + continue; |
| 35 | + } |
| 36 | + backtrack(expression + '*' + n, sum - prev + prev * n, prev * n, i + 1); |
| 37 | + backtrack(expression + '+' + n, sum + n, n, i + 1); |
| 38 | + backtrack(expression + '-' + n, sum - n, -n, i + 1); |
| 39 | + if (str === '0') return; |
| 40 | + } |
| 41 | + } |
| 42 | +}; |
0 commit comments