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.

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 -> []

 

解决方法：

挺麻烦的一道题，需要用到dfs的递归。

- 首先需要对数不停地切分

- 然后对每个数都有+、-、*的运算，特别注意‘*’需要前值才能正确计算出结果。

 

代码：

void dfs(vector<string>& res, string& num, int index, const int target, string cur,const long leftValue, const long preValue, char op){
        if (index == num.size()){
            if (target == leftValue)
                res.push_back(cur);
            
            return;
        }
        
        for(int i = index +1; i <= num.size();i++){
            string s = num.substr(index, i -index);
            long temp = stol(s);
            if (to_string(temp).size() != s.size())
                continue;
            
            dfs(res, num, i, target, cur +"+" + s, leftValue + temp, temp, '+');
            dfs(res, num, i, target, cur +"-" + s, leftValue - temp, temp, '-');
            dfs(res, num, i, target, cur +"*" + s, op == '+' ? (leftValue - preValue + preValue*temp) : ( op=='-' ? (leftValue + preValue - preValue*temp) : (preValue * temp) )
                , temp * preValue, op);
        }
    }
    
    vector<string> addOperators(string num, int target) {
        vector<string> res;
        for(int i = 1;i <= num.size(); i++){
            string s = num.substr(0, i);
            long cur = stol(s);
            if (to_string(cur).size() != s.size())
                continue;            
            dfs(res, num, i, target, s, cur, cur, '#');
        }
        return res;
    }