Shuffling Machine和双向链表

1. 双向链表

 https://github.com/BodhiXing/Data_Structure

2. Shuffling Machine

https://pta.patest.cn/pta/test/17/exam/4/question/264

思路：

代码：

#include <iostream>
using namespace std;

#define MAXCARD    54

string int2str(int x)
{
    char ch[4];
    sprintf(ch,"%d",x);
    return ch;
}

void Shuffling(string* str,const int* const ord )
{
    int i;
    string tmp[MAXCARD];
    
    for(i=0;i<MAXCARD;i++)
        tmp[ord[i]] = str[i];
    for(i=0;i<MAXCARD;i++)
        str[i] = tmp[i];
}
int main()
{
    int num,i;
    string card[MAXCARD];
    int order[MAXCARD];
    cin>>num;
    
    string str;
    for(i=0;i<13;i++)
    {
        str = int2str(i+1);
        card[i] = "S"+str;
        card[i+13] = "H"+str;
        card[i+26] = "C"+str;
        card[i+39] = "D"+str;
    }
    card[52] = "J1";
    card[53] = "J2";
    
    for(i=0;i<MAXCARD;i++)
    {
        cin>>order[i];
        order[i]--;  //和数组下标一致 0...53 
    }
    
    for(i=0;i<num;i++)
        Shuffling(card,order);
        
    for(i=0;i<MAXCARD-1;i++)
        cout<<card[i]<<" ";
    cout<<card[i];
    
    return 0;
}