https://blog.csdn.net/niu_gao/article/details/51458721

在內(nèi)存中模擬出一副牌，然后模擬洗牌，發(fā)牌等動(dòng)作。

流程是這樣的：構(gòu)建一副牌保存到一個(gè)數(shù)組中—洗牌—?jiǎng)?chuàng)建玩家—向玩家發(fā)牌–輸出每個(gè)玩家的牌。

#include <stdio.h> #include <stdlib.h> #include <time.h> //定義撲克的花色 enum Suit{heart,spade,diamond,club,joker1,joker2 }; //一副牌的數(shù)量 #define CARD_COUNT 54 //定義撲克 typedef struct Card{int value;//牌的點(diǎn)數(shù)從1開始enum Suit suit;//花色 }Card; //定義玩家 typedef struct Player{char name[64];//玩家的名字Card ** cards;//玩家分到的牌。每項(xiàng)是一個(gè)指針，指向原始一副牌數(shù)組中的一項(xiàng)，這樣可以節(jié)省空間int cardsCount;//玩家分到的牌的數(shù)量 }Player; //分牌完成后調(diào)用的函數(shù)的類型 typedef int (*COMPARE)(Card* ,Card*); //函數(shù)聲明們 char* getCardName(const Card*); Card** shuffle(const Card*); void dispatchCards(Player** ,int ,const Card** ); void sort(Card**,int,COMPARE); int compare1(Card* ,Card*); int compare2(Card* ,Card*); void initOnePack(); //原始一副牌所在的數(shù)組 Card pokers[CARD_COUNT]; //入口函數(shù) int main(void) {//初始化一副牌initOnePack();//洗牌，shuffledPokers保存洗后的牌們Card** shuffledPokers = shuffle(pokers);//構(gòu)建三個(gè)玩家Player player1;strcpy(player1.name,"隔壁老王");player1.cards=NULL;player1.cardsCount=0;Player player2;strcpy(player2.name,"小明");player2.cards=NULL;player2.cardsCount=0;Player player3;strcpy(player3.name,"田中龜孫");player3.cards=NULL;player3.cardsCount=0;//把三放到一個(gè)數(shù)組中，以傳入發(fā)牌函數(shù)中Player* players[]={&player1,&player2,&player3};//發(fā)牌dispatchCards(players,sizeof(players)/sizeof(Player*),shuffledPokers);//洗后的牌用完了，釋放之free(shuffledPokers);int i;//打印出每個(gè)玩家手中的牌for(i=0;i<sizeof(players)/sizeof(Player*);i++){//先打印玩家的名字printf("%s\n",players[i]->name);//需要對(duì)玩家手中的牌排序sort(players[i]->cards,players[i]->cardsCount,compare1);//打印玩家手中所有的牌int j;for(j=0;j<players[i]->cardsCount;j++){char * name = getCardName(players[i]->cards[j]);printf("%s ",name);free(name);}//每個(gè)玩家都需要換一次行printf("\n");}//釋放玩家手中牌的數(shù)組for(i=0;i<sizeof(players)/sizeof(Player*);i++){free(players[i]->cards);}return 0; } //構(gòu)造一副牌 void initOnePack(){int i=0;//前52張for(;i<CARD_COUNT-2;i++){pokers[i].value=i/4+1;pokers[i].suit = i%4;}//剩下的兩張：大王和小王//joker1pokers[i].value=i/4+1;pokers[i].suit=joker1;//joker2pokers[i+1].value=i/4+2;pokers[i+1].suit=joker2; } //洗牌，參數(shù)是原始的一副牌，返回洗完后的牌 Card** shuffle(const Card* pokers){int i;//分牌返回牌數(shù)組的內(nèi)存空間Card** retPokers = malloc(CARD_COUNT*sizeof(Card*));//為了不改動(dòng)原始的一副牌，另建一個(gè)數(shù)組，保存原始牌的指針（注意每項(xiàng)不是牌，而是牌的指針）Card** pokers2 = malloc(CARD_COUNT*sizeof(Card*));for(i=0;i<CARD_COUNT;i++){pokers2[i] = &pokers[i];}//種下隨機(jī)種子。種子取的是當(dāng)前時(shí)間，//所以保證了每次運(yùn)行程序時(shí)，產(chǎn)生的隨機(jī)數(shù)序列不同srand(time(NULL));//取得隨機(jī)序號(hào)，從pokers2取出序號(hào)所指的項(xiàng)，把它依次加到retPokers中。for(i=0;i<CARD_COUNT;i++){unsigned int index = rand()%CARD_COUNT;if(pokers2[index] != NULL){retPokers[i] = pokers2[index];pokers2[index]=NULL;}else{i--;}}free(pokers2);//返回洗完后的數(shù)組return retPokers; } //發(fā)牌 //players是玩家數(shù)組 //playerCount是玩家數(shù)量 //shuffledCards是洗完后的一副牌 void dispatchCards(Player** players,int playerCount,const Card** shuffledCards){//計(jì)算每個(gè)玩家手中牌的數(shù)組的容量，如果每個(gè)玩家手中的牌不一樣，//最多就差一張，加1是為了保證數(shù)組分配的空間足夠容納分到的牌。int numberCards = CARD_COUNT/playerCount+1;//為每個(gè)玩家的牌數(shù)組分配空間int i;for(i=0;i<playerCount;i++){Card* cards = malloc(numberCards*sizeof(Card*));players[i]->cards = cards;}//輪流向每個(gè)玩家發(fā)牌for(i=0;i<CARD_COUNT;i++){//取當(dāng)前玩家Player *curPlayer = players[i%playerCount];//向玩家發(fā)牌curPlayer->cards[curPlayer->cardsCount] = shuffledCards[i];//玩家手中實(shí)際的牌數(shù)增加curPlayer->cardsCount++;} } //排序函數(shù) //cards是要排序的牌，每一項(xiàng)是牌的指針 //cardsCount是牌的數(shù)量 //compare_func是比較函數(shù) void sort(Card** cards,int cardsCount,COMPARE compare_func){int i;for(i=0;i<cardsCount-1;i++){int j;for(j=0;j<cardsCount-i-1;j++){if(compare_func(cards[j],cards[j+1])){int tmp=cards[j];cards[j]=cards[j+1];cards[j+1]=tmp;}}} } //比較函數(shù)，先比較點(diǎn)數(shù)再比較花色 int compare1(Card* a,Card* b){if(a->value > b->value){return 1;}else if(a->value < b->value){return 0;}else{if(a->suit > b->suit)return 1;elsereturn 0;} } //比較函數(shù)，先比較點(diǎn)數(shù)再比較花色 int compare2(Card* a,Card* b){if(a->value > b->value){return 0;}else if(a->value < b->value){return 1;}else{if(a->suit > b->suit)return 0;elsereturn 1;} } //獲取牌的名字 //返回牌的名字字符串，調(diào)用者用完后需要free()之。 char* getCardName(const Card* card){//存放花色名字char suitStr[16]={0};//0=='\0'switch (card->suit) {case heart:strcpy(suitStr,"紅桃");break;case spade:strcpy(suitStr,"黑桃");break;case diamond:strcpy(suitStr,"方塊");break;case club:strcpy(suitStr,"梅花");break;}//存放點(diǎn)數(shù)名字char valueStr[16];switch(card->value){case 1:strcpy(valueStr,"A");break;case 11:strcpy(valueStr,"J");break;case 12:strcpy(valueStr,"Q");break;case 13:strcpy(valueStr,"K");break;case 14:strcpy(valueStr,"小王");break;case 15:strcpy(valueStr,"大王");break;default:sprintf(valueStr,"%d",card->value);break;}//動(dòng)態(tài)分配足夠的空間char * ret = malloc(16);//將兩個(gè)名字合并到ret中sprintf(ret,"%s%s",suitStr,valueStr);return ret; }

總結(jié)

以上是生活随笔為你收集整理的成为C++高手之实战项目的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問(wèn)題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。