Least Operators To Express Number Problem


Description

LeetCode Problem 964.

Given a single positive integer x, we will write an expression of the form x (op1) x (op2) x (op3) x … where each operator op1, op2, etc. is either addition, subtraction, multiplication, or division (+, -, *, or /). For example, with x = 3, we might write 3 * 3 / 3 + 3 - 3 which is a value of 3.

When writing such an expression, we adhere to the following conventions:

  • The division operator (/) returns rational numbers.
  • There are no parentheses placed anywhere.
  • We use the usual order of operations: multiplication and division happen before addition and subtraction.
  • It is not allowed to use the unary negation operator (-). For example, “x - x” is a valid expression as it only uses subtraction, but “-x + x” is not because it uses negation.

We would like to write an expression with the least number of operators such that the expression equals the given target. Return the least number of operators used.

Example 1:

1
2
3
4
Input: x = 3, target = 19
Output: 5
Explanation: 3 * 3 + 3 * 3 + 3 / 3.
The expression contains 5 operations.

Example 2:

1
2
3
4
Input: x = 5, target = 501
Output: 8
Explanation: 5 * 5 * 5 * 5 - 5 * 5 * 5 + 5 / 5.
The expression contains 8 operations.

Example 3:

1
2
3
4
Input: x = 100, target = 100000000
Output: 3
Explanation: 100 * 100 * 100 * 100.
The expression contains 3 operations.

Constraints:

  • 2 <= x <= 100
  • 1 <= target <= 2 * 10^8


Sample C++ Code

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
class Solution {
public:
    int leastOpsExpressTarget(int x, int target) {
        vector<int> levels;
        while (target) {
            levels.push_back(target % x);
            target /= x;
        }
        int carrybitted = levels.size(), nocarrybitted = 0;
        for (int i = levels.size() - 1; i > 0; --i) {
            int carry = min((x - levels[i] - 1) * i + carrybitted, (levels[i] + 1) * i + nocarrybitted);
            int nocarry = min((x - levels[i]) * i + carrybitted, levels[i] * i + nocarrybitted);
            carrybitted = carry;
            nocarrybitted = nocarry;
        }
        return min(levels[0] * 2 + nocarrybitted, (x - levels[0]) * 2 + carrybitted) - 1;
    }
};




Related Posts

Valid Permutations For DI Sequence Problem

LeetCode 903. You are given a string s of length...

Tallest Billboard Problem

LeetCode 956. You are installing a billboard and want it...

Sum Of Subarray Minimums Problem

LeetCode 907. Given an array of integers arr, find the...

Stone Game Problem

LeetCode 877. Alice and Bob play a game with piles...

Split Array With Same Average Problem

LeetCode 805. You are given an integer array nums.

Soup Servings Problem

LeetCode 808. There are two types of soup, type A...