题解 | #扑克牌大小#
扑克牌大小
http://www.nowcoder.com/practice/d290db02bacc4c40965ac31d16b1c3eb
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
string a;
while(getline(cin,a))
{
string b,c;
for(int i=0;i<a.length();i++)
{
if(a[i]=='-')
{
b=a.substr(0,i);
c=a.substr(i+1,a.length()-1-i);
break;
}
}
vector<string> d,e;
for(int i=0;i<b.length();i++)
{
if(b[i]==' ')
{
d.push_back(b.substr(0,i));
b=b.substr(i+1,b.length()-1-i);
i=-1;
}
else if(b[i]!=' '&&i==b.length()-1)
{
d.push_back(b);
break;
}
}
for(int i=0;i<c.length();i++)
{
if(c[i]==' ')
{
e.push_back(c.substr(0,i));
c=c.substr(i+1,c.length()-1-i);
i=-1;
}
else if(c[i]!=' '&&i==c.length()-1)
{
e.push_back(c);
break;
}
}
vector<string>w={"3","4","5","6","7","8","9","10","J","Q","K","A","2","joker","JOKER"};
if(d[0]==w[14]&&d[1]==w[13]||d[0]==w[13]&&d[1]==w[14])
{
cout<<d[0]<<' '<<d[1]<<endl;
}
else if(e[0]==w[14]&&e[1]==w[13]||e[0]==w[13]&&e[1]==w[14])
{
cout<<e[0]<<' '<<e[1]<<endl;
}
else if(d.size()==4||e.size()==4)
{
if(d.size()==4&&e.size()==4)
{
if(find(w.begin(),w.end(),d[0])<find(w.begin(),w.end(),e[0]))
{
cout<<e[0]<<' '<<e[1]<<' '<<e[2]<<' '<<e[3]<<endl;
}
else
{
cout<<d[0]<<' '<<d[1]<<' '<<d[2]<<' '<<d[3]<<endl;
}
}
else if(d.size()==4&&e.size()!=4)
{
cout<<d[0]<<' '<<d[1]<<' '<<d[2]<<' '<<d[3]<<endl;
}
else if(d.size()!=4&&e.size()==4)
{
cout<<e[0]<<' '<<e[1]<<' '<<e[2]<<' '<<e[3]<<endl;
}
}
else if(d.size()==e.size())
{
if(find(w.begin(),w.end(),d[0])<find(w.begin(),w.end(),e[0]))
{
if(e.size()==1)
{
cout<<e[0]<<endl;
}
else if(e.size()==2)
{
cout<<e[0]<<' '<<e[1]<<endl;
}
else if(e.size()==3)
{
cout<<e[0]<<' '<<e[1]<<' '<<e[2]<<endl;
}
else if(e.size()==5)
{
cout<<e[0]<<' '<<e[1]<<' '<<e[2]<<' '<<e[3]<<' '<<e[4]<<endl;
}
}
else
{
if(d.size()==1)
{
cout<<d[0]<<endl;
}
else if(d.size()==2)
{
cout<<d[0]<<' '<<d[1]<<endl;
}
else if(d.size()==3)
{
cout<<d[0]<<' '<<d[1]<<' '<<d[2]<<endl;
}
else if(d.size()==5)
{
cout<<d[0]<<' '<<d[1]<<' '<<d[2]<<' '<<d[3]<<' '<<d[4]<<endl;
}
}
}
else
{
cout<<"ERROR"<<endl;
}
}
return(0);
}
#include<string>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
string a;
while(getline(cin,a))
{
string b,c;
for(int i=0;i<a.length();i++)
{
if(a[i]=='-')
{
b=a.substr(0,i);
c=a.substr(i+1,a.length()-1-i);
break;
}
}
vector<string> d,e;
for(int i=0;i<b.length();i++)
{
if(b[i]==' ')
{
d.push_back(b.substr(0,i));
b=b.substr(i+1,b.length()-1-i);
i=-1;
}
else if(b[i]!=' '&&i==b.length()-1)
{
d.push_back(b);
break;
}
}
for(int i=0;i<c.length();i++)
{
if(c[i]==' ')
{
e.push_back(c.substr(0,i));
c=c.substr(i+1,c.length()-1-i);
i=-1;
}
else if(c[i]!=' '&&i==c.length()-1)
{
e.push_back(c);
break;
}
}
vector<string>w={"3","4","5","6","7","8","9","10","J","Q","K","A","2","joker","JOKER"};
if(d[0]==w[14]&&d[1]==w[13]||d[0]==w[13]&&d[1]==w[14])
{
cout<<d[0]<<' '<<d[1]<<endl;
}
else if(e[0]==w[14]&&e[1]==w[13]||e[0]==w[13]&&e[1]==w[14])
{
cout<<e[0]<<' '<<e[1]<<endl;
}
else if(d.size()==4||e.size()==4)
{
if(d.size()==4&&e.size()==4)
{
if(find(w.begin(),w.end(),d[0])<find(w.begin(),w.end(),e[0]))
{
cout<<e[0]<<' '<<e[1]<<' '<<e[2]<<' '<<e[3]<<endl;
}
else
{
cout<<d[0]<<' '<<d[1]<<' '<<d[2]<<' '<<d[3]<<endl;
}
}
else if(d.size()==4&&e.size()!=4)
{
cout<<d[0]<<' '<<d[1]<<' '<<d[2]<<' '<<d[3]<<endl;
}
else if(d.size()!=4&&e.size()==4)
{
cout<<e[0]<<' '<<e[1]<<' '<<e[2]<<' '<<e[3]<<endl;
}
}
else if(d.size()==e.size())
{
if(find(w.begin(),w.end(),d[0])<find(w.begin(),w.end(),e[0]))
{
if(e.size()==1)
{
cout<<e[0]<<endl;
}
else if(e.size()==2)
{
cout<<e[0]<<' '<<e[1]<<endl;
}
else if(e.size()==3)
{
cout<<e[0]<<' '<<e[1]<<' '<<e[2]<<endl;
}
else if(e.size()==5)
{
cout<<e[0]<<' '<<e[1]<<' '<<e[2]<<' '<<e[3]<<' '<<e[4]<<endl;
}
}
else
{
if(d.size()==1)
{
cout<<d[0]<<endl;
}
else if(d.size()==2)
{
cout<<d[0]<<' '<<d[1]<<endl;
}
else if(d.size()==3)
{
cout<<d[0]<<' '<<d[1]<<' '<<d[2]<<endl;
}
else if(d.size()==5)
{
cout<<d[0]<<' '<<d[1]<<' '<<d[2]<<' '<<d[3]<<' '<<d[4]<<endl;
}
}
}
else
{
cout<<"ERROR"<<endl;
}
}
return(0);
}
巨人网络成长空间 50人发布

查看29道真题和解析