LeetCode #282 - Expression Add Operators

题目描述:

Given a string that contains only digits 0-9 and a target value, return all possibilities to add binary operators (not unary) +, -, or *between the digits so they evaluate to the target value.

Example 1:

Input: num = "123", target = 6

Output: ["1+2+3", "1*2*3"] 

Example 2:

Input: num = "232", target = 8

Output: ["2*3+2", "2+3*2"]

Example 3:

Input: num = "105", target = 5

Output: ["1*0+5","10-5"]

Example 4:

Input: num = "00", target = 0

Output: ["0+0", "0-0", "0*0"]

Example 5:

Input: num = "3456237490", target = 9191

Output: []

/***
 * @param num     remaining string of numbers
 * @param target  target value
 * @param curExp  current expression
 * @param curRes  result of current expression
 * @param preNum  previous value (for multiply)
 * a + b - c * d + preNum # cur , # can take +/-/*, use recursion to solve it
 * curExp = "a+b-c*d+preNum"
 */
class Solution {
public:
    void addOperatorsDFS(string num, int target, long long preNum, long long curRes, string curExp, vector<string> &res) {
        if (num.size() == 0 && curRes == target) {
            res.push_back(curExp);
        }
        for (int i = 1; i <= num.size(); ++i)
        {
            string cur = num.substr(0, i); //截取前i个字符作为运算数字
            if (cur.size() > 1 && cur[0] == '0') return; //过滤首字符为0的数字
            string remain = num.substr(i);
            if (curExp.size() == 0) addOperatorsDFS(remain, target, stoll(cur), stoll(cur), cur, res);
            else
            {
                addOperatorsDFS(remain, target, stoll(cur), curRes + stoll(cur), curExp + "+" + cur, res);
                addOperatorsDFS(remain, target, -stoll(cur), curRes - stoll(cur), curExp + "-" + cur, res);
                addOperatorsDFS(remain, target, preNum * stoll(cur), (curRes - preNum) + preNum * stoll(cur), curExp + "*" + cur, res);
            }
        }
    }

    vector<string> addOperators(string num, int target) {
        vector<string> res;
        addOperatorsDFS(num, target, 0, 0, "", res);
        return res;
    }
};

 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值