Expression Add Operators(leetcode)

LeetCode题解:ExpressionAddOperators
本文介绍了一个LeetCode上的编程挑战题“ExpressionAddOperators”,该题要求在给定的数字串中添加算术运算符,使得最终表达式的计算结果等于目标值。文中提供了一种递归回溯的方法来解决这个问题,并通过实例演示了如何实现。

Expression Add Operators


题目

leetcode题目
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.
Examples:

"123", 6 -> ["1+2+3", "1*2*3"] 
"232", 8 -> ["2*3+2", "2+3*2"]
"105", 5 -> ["1*0+5","10-5"]
"00", 0 -> ["0+0", "0-0", "0*0"]
"3456237490", 9191 -> []

解决

class Solution {
public:
    void addOperator(vector<string> & result, string nums, string r, long long last, long long current, int target) {
        if (nums.length() == 0) {
            if (current == target) {
                result.push_back(r);
            }
            return;
        }
        for (int i = 1; i <= nums.length(); i++) {
            string num = nums.substr(0, i);
            if (num.length() >= 2 && num[0] == '0') {
                return;
            }
            string next = nums.substr(i);
            if (r.length() > 0) {
                addOperator(result, next, r + "+" + num, stoll(num), current + stoll(num), target);
                addOperator(result, next, r + "-" + num, -stoll(num), current - stoll(num), target);
                addOperator(result, next, r + "*" + num, last * stoll(num), (current - last) + (last * stoll(num)), target);
            } else {
                addOperator(result, next, num, stoll(num), stoll(num), target);
            }
        }
    }

    vector<string> addOperators(string num, int target) {
        vector<string> result;
        addOperator(result, num, "", 0, 0, target);
        return result;
    }
};
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值