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

给你一个串，然后和24点一样添加 ‘+’ ‘-’ ‘*’ 三种运算，使之成为指定值，求出所有解

题解

直接模拟运算，pre 表示之前的结果（总是与现在的相乘），pos是现在的位置，target是要取得的值
要使 pre * num_now ( ? ) num_shengyu = target

代码

class Solution {
public:
    string nums;
    vector<string> dfs( long long pre, int pos, long long target ){
        vector<string> ans;
        if( pos >= (int)nums.size() ){
            if( target == 0 ){
                ans.push_back("");
            }
            return ans;
        }
        long long cnt = 0;
        string sn = "";
        for( int i = pos; i < (int)nums.size(); i++ ){
            cnt = cnt * 10 + nums[i] - '0';
            sn += nums[i];
            if( i == (int)nums.size() - 1 ){
                if( target == cnt * pre ){
                    ans.push_back( sn );
                }
                continue;
            }
            vector<string> temp = dfs( 1, i + 1, target - cnt *pre );
            for( int j = 0; j < (int)temp.size(); j++ ){
                ans.push_back( sn + "+" + temp[j] );
            }
            temp = dfs( -1, i + 1, target - cnt * pre  );
            for( int j = 0; j < (int)temp.size(); j++ ){
                ans.push_back( sn + "-" + temp[j] );
            }
            temp = dfs( pre * cnt, i + 1, target );
            for( int j = 0; j < (int)temp.size(); j++ ){
                ans.push_back( sn + "*" + temp[j] );
            }
            if( i == pos && nums[i] == '0' ){
                break;
            }
        }
        return ans;
    }

    vector<string> addOperators(string num, int target) {
        nums = num;
        vector<string> ans = dfs( 1, 0, target );
        sort( ans.begin(), ans.end() );
        return ans;
    }
};