Skip to content

282. Expression Add Operators

Description

Given a string num that contains only digits and an integer target, return all possibilities to insert the binary operators '+', '-', and/or '*' between the digits of num so that the resultant expression evaluates to the target value.

Note that operands in the returned expressions should not contain leading zeros.

 

Example 1:

Input: num = "123", target = 6
Output: ["1*2*3","1+2+3"]
Explanation: Both "1*2*3" and "1+2+3" evaluate to 6.

Example 2:

Input: num = "232", target = 8
Output: ["2*3+2","2+3*2"]
Explanation: Both "2*3+2" and "2+3*2" evaluate to 8.

Example 3:

Input: num = "3456237490", target = 9191
Output: []
Explanation: There are no expressions that can be created from "3456237490" to evaluate to 9191.

 

Constraints:

  • 1 <= num.length <= 10
  • num consists of only digits.
  • -231 <= target <= 231 - 1

 

Solutions

Solution: Backtracking

  • Time complexity: O(4n)
  • Space complexity: O(n2)

 

JavaScript

js
/**
 * @param {string} num
 * @param {number} target
 * @return {string[]}
 */
const addOperators = function (num, target) {
  const n = num.length;
  const result = [];
  const backtrackingExpression = (start, expression, total, last) => {
    if (start === n) {
      total === target && result.push(expression);
      return;
    }
    let current = '';

    for (let index = start; index < n; index++) {
      current += num[index];

      if (current.length > 1 && current[0] === '0') return;
      const next = +current;
      const product = last * next;

      backtrackingExpression(index + 1, `${expression}+${current}`, total + next, next);
      backtrackingExpression(index + 1, `${expression}-${current}`, total - next, -next);
      backtrackingExpression(index + 1, `${expression}*${current}`, total - last + product, product);
    }
  };
  let current = '';

  for (let index = 0; index < n; index++) {
    current += num[index];
    if (current.length > 1 && current[0] === '0') return result;
    backtrackingExpression(index + 1, current, +current, +current);
  }
  return result;
};

Released under the MIT license