Simplified Expression Add Operators

Problem

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

Solution

Simplification

This is a simplified version of Expression Add Operators. I’ve relaxed the requirements to only require the + and - operators, and 0 is not a valid digit.

public class ExpressionAddOperators {
  public static void main(String[] args) {
    System.out.println(solve(new int[]{1, 2, 3}, 6));
    System.out.println(solve(new int[]{1, 2, 3, 4}, 6));
    System.out.println(solve(new int[]{1, 2, 3, 4}, 119));
    System.out.println(solve(new int[]{1, 2, 3, 4}, 46));
  }

  public static List<String> solve(int[] nums, int target) {
    var ans = new ArrayList<String>();
    solve(nums, target, 0, 0, 0, "", ans);
    return ans;
  }

  public static void solve(int[] nums,
                           int target,
                           int index,
                           int evaluatedValue,
                           int operand,
                           String currExpr,
                           List<String> ans) {
    if (index == nums.length) {
      if (evaluatedValue == target && operand == 0) {
        ans.add(currExpr.substring(1));
      }
      return;
    }

    operand = operand * 10;
    operand = operand + nums[index];
    solve(nums, target, index + 1, evaluatedValue, operand, currExpr, ans);

    solve(nums, target, index + 1, evaluatedValue + operand, 0, currExpr + String.format("+%s", operand), ans);

    // not allowed
    if (!currExpr.isEmpty()) {
      solve(nums, target, index + 1, evaluatedValue - operand, 0, currExpr + String.format("-%s", operand), ans);
    }
  }
}

Recent posts from blogs that I like

Test iCloud Drive using Cirrus

Problems syncing files with iCloud Drive? Don't just turn it off and back on again. Use Cirrus instead to upload a test file, and check whether syncing that works. Full details.

via The Eclectic Light Company

Concurrent Servers: Part 8 - Go

This is part 8 in a series of posts on writing concurrent network servers. In this part, we'll switch to Go and see how it tackles the challenges described earlier in the series. All posts in the series: Part 1 - Introduction Part 2 - Threads Part 3 - Event-driven Part 4 - libuv Part 5 - Redis case ...

via Eli Bendersky

You should never be angry at work

I try not to give a lot of prescriptive advice about working in tech companies1. There are many ways to be successful, and every company works differently. If you’re shipping projects and your management chain is happy, it doesn’t really matter how you’ve accomplished it. However, there’s one thing ...

via Sean Goedecke