扑克牌-->牛客最搞心态的题目

#include
#include
#include
#include
#include
using namespace std;
#define B_KING 200
#define S_KING 100
bool isDoubleKing(vector& arr)
{
return arr[0] == S_KING && arr[1] == B_KING;
}
bool isDouble(vector& arr)
{
return arr[0] == arr[1];
}
bool isShun(vector& arr)
{
for (int i = 0; i < 4; i++)
{
if ((arr[i] + 1) != arr[i + 1])
return false;
}
return true;
}
bool isBomp(vector& arr)
{
for (int i = 0; i < 3; i++)
{
if (arr[i] != arr[i + 1])
return false;
}
return true;
}
bool isThree(vector& arr)
{
for (int i = 0; i < 2; i++)
{
if (arr[i] != arr[i + 1])
return false;
}
return true;
}

vector judge(vector& arr1, vector& arr2)
{
//判断有没有王炸,有王炸直接返回
vectorres;
if (arr1.size() == 2 && isDoubleKing(arr1))
{
res = arr1;
return res;
}
if (arr2.size() == 2 && isDoubleKing(arr2))
{
res = arr2;
return res;
}

//判断炸弹
//如果两个都是炸弹,拿出最大的
if (arr1.size() == 4 && arr2.size() == 4 && isBomp(arr1) && isBomp(arr2))
{
    if (arr1[0] > arr2[0])
    {
        res = arr1;
    }
    else
        res = arr2;
    return res;
}

//一个是炸弹,一个不是
if (arr1.size() == 4 && isBomp(arr1))
{
    res = arr1;
    return res;
}
if (arr2.size() == 4 && isBomp(arr2))
{
    res = arr2;
    return res;
}

//两个都是顺子
if (arr1.size() == 5 && arr2.size() == 5 && isShun(arr1) && isShun(arr2))
{
    if (arr1[0] > arr2[0])
        res = arr1;
    else
        res = arr2;
    return res;
}

//两个都是豹子
if (arr1.size() == 3 && arr2.size() == 3 && isThree(arr1) && isThree(arr2))
{
    if (arr1[0] > arr2[0])
        res = arr1;
    else
        res = arr2;
    return res;
}

//两个都是对
if (arr1.size() == 2 && arr2.size() == 2 && isDouble(arr1) && isDouble(arr2))
{
    if (arr1[0] > arr2[0])
        res = arr1;
    else
        res = arr2;
    return res;
}

//两个都是单
if (arr1.size() == 1 && arr2.size() == 1)
{
    if (arr1[0] > arr2[0])
        res = arr1;
    else
        res = arr2;
    return res;
}

return res;

}
void StoV(string& s, vector& arr1, vector& arr2)
{
//先找分割点
int idx = 0;
for (idx = 0; idx < s.size(); idx++)
{
if (s[idx] == ‘-’)
{
break;
}
}
string str1;
string str2;
for (int i = 0; i < idx; i++)
{
str1.push_back(s[i]);
}
for (int i = idx + 1; i < s.size(); i++)
{
str2.push_back(s[i]);
}

stringstream ss;
ss << str1;
string tmp;
while (ss >> tmp)
{
    if (tmp == "A")
    {
        arr1.push_back(14);
    }
    else if (tmp == "K")
    {
        arr1.push_back(13);
    }
    else if (tmp == "Q")
    {
        arr1.push_back(12);
    }
    else if (tmp == "J")
    {
        arr1.push_back(11);
    }
    else if (tmp == "joker")
    {
        arr1.push_back(S_KING);
    }
    else if (tmp == "JOKER")
    {
        arr1.push_back(B_KING);
    }
    else if (tmp == "10")
    {
        arr1.push_back(10);
    }
    else
        arr1.push_back(tmp[0] - '0');
}
ss.clear();
ss << str2;
while (ss >> tmp)
{
    if (tmp == "A")
    {
        arr2.push_back(14);
    }
    else if (tmp == "K")
    {
        arr2.push_back(13);
    }
    else if (tmp == "Q")
    {
        arr2.push_back(12);
    }
    else if (tmp == "J")
    {
        arr2.push_back(11);
    }
    else if (tmp == "joker")
    {
        arr2.push_back(S_KING);
    }
    else if (tmp == "JOKER")
    {
        arr2.push_back(B_KING);
    }
    else if (tmp == "10")
    {
        arr2.push_back(10);
    }
    else
        arr2.push_back(tmp[0] - '0');
}
sort(arr1.begin(), arr1.end());
sort(arr2.begin(), arr2.end());

}
void VtoS(string& res, vector& arr)
{
if (arr.empty())
return;
for (int i = 0; i < arr.size(); i++)
{
if (arr[i] == S_KING)
{
res += "joker ";
}
else if (arr[i] == B_KING)
{
res += "JOKER ";
}
else if (arr[i] == 14)
{
res += "A ";
}
else if (arr[i] == 13)
{
res += "K ";
}
else if (arr[i] == 12)
{
res += "Q ";
}
else if (arr[i] == 11)
{
res += "J ";
}
else if (arr[i] == 10)
{
res += "10 ";
}
else
{
res += arr[i] + ‘0’;
res += ’ ';
}
}
res.pop_back();
}
int main()
{
string str;
getline(cin, str);
vectorarr1;
vectorarr2;
vectorarr;
string res;
StoV(str, arr1, arr2);
arr = judge(arr1, arr2);
VtoS(res, arr);
if (res.empty())
cout << “ERROR” << endl;
else
cout << res << endl;
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值