这个题一开始,估摸估摸着数据量,感觉应该能用暴力暴力出来,只可惜自己写的暴力有问题,自己一开始的思想是,将4个数分为两两一组组,每组做加减乘除运算…很天真对吧现在看起来,也确实很天真。比如出现a+bcd这种情况就没法解出来了。核心思想就是递归,两两合并填入数组再递归,递归到数组大小为1为止。(吐槽一下, float精度真差,除非设成fabs()<=1e-3,否则有个案例过不了,但是用double就挺好的)
#define float double //大家可以把这行注释掉看看结果
class Solution {
public:
int a[6];
int tar = 24;
int dfs(vector<float>v)
{
int re = 0;
if (v.size() == 1)
{
if (fabs(v[0]- tar)<=1e-6)
return 1;
return 0;
}
for(int i=0;i<v.size();i++)
for (int j = i + 1; j < v.size(); j++)
{
vector<float>v1 = v;
float tem1 = v[i]; float tem2 = v[j];
v1.erase(v1.begin()+j);
v1[i] = tem1 + tem2; re|=dfs(v1);
v1[i] = tem1 - tem2; re |= dfs(v1);
v1[i] = tem2 - tem1; re |= dfs(v1);
if(tem2)
v1[i] = tem1 / tem2; re |= dfs(v1);
if(tem1)
v1[i] = tem2 / tem1; re |= dfs(v1);
v1[i] = tem1 * tem2; re |= dfs(v1);
}
return re;
}
bool judgePoint24(vector<int>& cards) {
vector<float>v;
for(int i=0;i<4;i++)
v.push_back(cards[i]);
if (dfs(v))
return true;
else
return false;
}
};