【Leetcode】964. Least Operators to Express Number 表示数字的最少运算符

最新推荐文章于 2022-09-05 16:27:16 发布

MYSDB

最新推荐文章于 2022-09-05 16:27:16 发布

阅读量1.1k

点赞数

分类专栏： Leetcode

本文链接：https://blog.csdn.net/lemonmillie/article/details/86628980

版权

Leetcode 专栏收录该内容

129 篇文章 1 订阅

订阅专栏

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 happens before addition and subtraction.
It’s 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:

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

Example 2:

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

Example 3:

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

Note:

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

解法

无语辽，想了3个小时= =
这个就算能想出来也没法在面试的时候想出来……
首先要注意审题，没有括号意味着：

最后结果一定是x的i次方相加减（i>=0）
由于target是整数所以不可能有i<0

这样的话我们第一反应就是把target转换成x进制，得到：
$\text{target} = \sum_ia_ix^i$
首先需要注意，组合 $x^i$ 需要 $m$ 个运算符，m = i==0?1:i-1
我们需要组合出每个 $a_i$ 不为0的 $a_ix^i$ ，这有两种方法：

用 $a_i$ 个 $x^i$ 相加，这时第i位需要的运算符为 $a_i*(m+1)$
借一个高位过来，用一个 $x^{i+1}$ 减去 $x-a_i$ 个 $x^i$ ，这样第i位需要的运算符为 $x-a_i)*(m+1)$ ，只不过第i+1位从要组合 $a_{i+1}x^{i+1}$ 变成了要组合 $a_{i+1})x^{i+1}$

所以，每一位有两种可能性，一种是要组合 $a_i$ ，另一种是要组合 $a_i+1$ ，我们令 $f [i] [0]$ 表示第i位组合 $a_i$ 时的最小运算符数， $f [i] [1]$ 表示第i位组合 $a_i+1$ 时的最小运算符数。得到状态转移方程
$f[i][0] = \min\{f[i+1][0]+a_i*(m+1), f[i+1][1]+(x-a_i)*(m+1)\}$
$f[i][1] = \min\{f[i+1][0]+(a_i+1)*(m+1), f[i+1][1]+(x-a_i-1)*(m+1)\}$
为了节省空间，可以只用2个变量
代码如下：

class Solution(object):
    def leastOpsExpressTarget(self, x, target):
        """
        :type x: int
        :type target: int
        :rtype: int
        """
        n = int(math.log(target,x))
        mask = x**n
        last = [0,n+1]
        for i in xrange(n,-1,-1):
            d = target//mask
            multis = 2 if i==0 else i
            last = [min(last[1]+(x-d)*multis,last[0]+d*multis), min(last[1]+(x-d-1)*multis,last[0]+(d+1)*multis)]
            target = target % mask
            mask /=x
        return last[0]-1