leetcode 24 Game

最新推荐文章于 2021-01-03 23:10:47 发布

half2orc

最新推荐文章于 2021-01-03 23:10:47 发布

阅读量144

点赞数

分类专栏： C++

本文链接：https://blog.csdn.net/sinat_34407981/article/details/79475292

版权

C++ 专栏收录该内容

3 篇文章 0 订阅

订阅专栏

string doubleToString(double num)
{
    stringstream ss;
    string str;
    ss << num;
    ss >> str;
    return str;
}


void helper(vector<double>& num, vector<char>& ops, double eps,vector<string>& str,vector<string>& vecRes)
{
    if(num.size() == 1) {
        if(abs(num[0] - 24) < eps) {
            vecRes.push_back(str[0]);

        }
    }
    for(unsigned int i = 0; i < num.size(); ++i) {
        for(unsigned int j = 0; j < num.size(); ++j) {
            if(i == j)  continue;
            vector<double> temp;
            vector<string> s;
            for(unsigned int k = 0; k < num.size(); k++) {
                if(k != i && k != j) { 
                    temp.push_back(num[k]); 
                    s.push_back(str[k]);
                }
            }
            for(char ch : ops) {
                if(((ch == '+') | (ch == '*')) && (i > j)) continue;
                if((ch == '/') && num[j] < eps) continue;
                switch(ch) {
                    case '+':
                        temp.push_back(num[i] + num[j]);
                        s.push_back("(" + str[i] + "+" + str[j] + ")");
                        break;
                    case '-':
                        temp.push_back(num[i] - num[j]);
                        s.push_back("(" + str[i] + "-" + str[j] + ")");
                        break;
                    case '*':
                        temp.push_back(num[i] * num[j]);
                        s.push_back("(" + str[i] + "*" + str[j] + ")");
                        break;
                    case '/':
                        temp.push_back(num[i] / num[j]);
                        s.push_back("(" + str[i] + "/" + str[j] + ")");
                        break; 
                }
                helper(temp, ops, eps, s, vecRes);
                temp.pop_back();
                s.pop_back();
            }
        }
    }
}

int judgePoint24(vector<int>& num, vector<string>& vecRes)
{
    double eps = 0.001;
    vector<char> ops{ '+', '-', '*', '/' };
    vector<double> arr(num.begin(), num.end());    
    vector<string> str;
    for(unsigned int i = 0; i < num.size(); i++) {
        str.push_back(doubleToString(num[i]));
    }
    helper(arr, ops, eps, str, vecRes);
    return vecRes.size();
}