一沓扑克牌中剔除等于13或者相邻之和等于13的扑克牌，剩余多少

一沓扑克牌中剔除等于13或者相邻之和等于13的扑克牌，如果最后一个和第一个之和为13，同样剔除

最后剩余的扑克牌数目

Tommy is learning a simple card game called Circle. To play the game, the single player shuffles a deck of cards. He or she then flips through the deck, removing all instances of the 'K' card, and all consecutive pairs of cards that add up to 13. The deck does wrap around, so that if the last card remaining in the deck and the first card remaining in the deck add up to 13, they are both removed. The player keeps cycling through the deck until no more cards can be removed.

Create a class CircleGame containing the method cardsLeft that takes a string deck representing a not-necessarily complete nor correct deck of cards. Each character of deck represents the value of a card without the suit. The values shown on the card represent the following numerical values:

'A' - 1
'2' - 2
'3' - 3
'4' - 4
'5' - 5
'6' - 6
'7' - 7
'8' - 8
'9' - 9
'T' - 10
'J' - 11
'Q' - 12
'K' - 13

#include <algorithm>
#include <vector>
#include <iterator>
using namespace std;
#define N 10
class bp
{
public:
bool operator()(int a,int b)
{
return (a+b==13);
}
};
class CircleGame
{
private:
vector<int> change(string deck)
{
int len =deck.size();
int val;
vector<int> v(len);
for(int i=0 ; i < len ;i++)
{
if(deck[i]=='A')
val=1;
else if(deck[i]=='T')
val=10;
else if(deck[i]=='J')
val=11;
else if(deck[i]=='Q')
val=12;
else if(deck[i]=='K')
val=13;
else
val=deck[i]-'0';
v[i]=val;
}
return v;
}
int gnext(int i, vector<bool> status)
{
int len =status.size();
int k = (i+1)%len;
while(!status[k])
{
k=(k+1)%len;
if(k==i)
{
k=-1;
break;
}
}
return k;

}
public:
int cardsLeft(string deck)
{
vector<int> deckVal =change(deck);
int len=deckVal.size();
//copy(deck.begin(),deck.end(),ostream_iterator<char>(cout," "));

//cout<<" "<<deck.size()<<endl;
//copy(deckVal.begin(),deckVal.end(),ostream_iterator<int>(cout," "));
//cout<<" "<<deckVal.size()<<endl;
vector<bool> status(len,true);
bool cur=false;
int i=0;
while(1)
{
i=gnext(i,status);
if(i==-1)
return len;
if(deckVal[i]==13)
{
len--;
status[i]=false;
cur=true;
}
else
{
int k = gnext(i,status);
if(k==-1)
return len;
else if(k < i)
{
if((deckVal[i]+deckVal[k])==13)
{
len=len-2;
cur=true;
status[i]=false;
status[k]=false;
}else
{
if(cur)
cur=false;
else
return len;

}
}else
{
if((deckVal[i]+deckVal[k])==13)
{
len=len-2;
cur=true;
status[i]=false;
status[k]=false;
}
}

}//else
}
}
};