C++撲克牌的洗牌發(fā)牌游戲設(shè)計(jì)
筆者在大學(xué)二年級(jí)期間,做過的一次C++程序設(shè)計(jì):撲克牌的洗牌發(fā)牌游戲。具體內(nèi)容是:除去大王和小王,將52張撲克牌洗牌,并發(fā)出5張牌。然后判斷這5張牌中有幾張相同大小的牌,是否是一條鏈,有幾個(gè)同花等。
筆者在學(xué)習(xí)他人設(shè)計(jì)的基礎(chǔ)上,完成了自己的程序設(shè)計(jì)。這里將源程序分享給大家。
[1] 文件“card.h”
#ifndef CARD_H
#define CARD_H
#include<string>
using namespace std;
class Card
{
public:
static const int totalFaces=13;
static const int totalSuits=4;
Card(int,int);
int getFace();
int getSuit();
string toString();
private:
int face,suit;
static const string faceNames[totalFaces];
static const string suitNames[totalSuits];
};
#endif // CARD_H
[2] 文件“card.cpp”
#include"card.h"
Card::Card(int faceNumber,int suitNumber)
{
face=faceNumber;
suit=suitNumber;
}
string Card::toString()
{
return faceNames[face]+" of "+suitNames[suit];
}
int Card::getFace() {return face;}
int Card::getSuit() {return suit;}
const string Card::faceNames[totalFaces]=
{"A","2","3","4","5","6","7","8","9","10","J","Q","K"};
const string Card::suitNames[totalSuits]=
{"heart","diamond","club","spade"};
[3] 文件“deckofcards.h”
#ifndef DECKOFCARDS_H
#define DECKOFCARDS_H
#include<vector>
#include"card.h"
using namespace std;
class DeckOfCards
{
public:
static const int fiveCards=5;
static const int allCards=52;
DeckOfCards();
void shuffle();
Card dealCard(int);
void sortCards();
int duiziCards(int* sortFaces);
//bool moreCards();
private:
vector<Card> deck;
int currentCard;
};
#endif // DECKOFCARDS_H
[4] 文件“deckofcards.cpp”
#include"deckofcards.h"
#include<cstdlib>
#include<ctime>
DeckOfCards::DeckOfCards()
{
//currentCard=0;
for(int i=0;i<allCards;i++)
{
Card card(i%Card::totalFaces,i/Card::totalFaces);
deck.push_back(card);
}
}
void DeckOfCards::shuffle()
{
srand(time(0));
int swapRandom[allCards];
for(int i=0;i<allCards;i++)
swapRandom[i]=int(rand())%allCards;
for(int i=0;i<allCards;i++)
{
Card swapCard(0,0);
swapCard=deck[i];
deck[i]=deck[swapRandom[i]];
deck[swapRandom[i]]=swapCard;
}
}
Card DeckOfCards::dealCard(int how_many)
{
for(int i=0;i<how_many;i++)
{
cout <<deck[i].toString() <<endl;
if((i+1)%13==0) cout <<endl;
}
}
void DeckOfCards::sortCards()
{
int sortFaces[fiveCards];
int sortSuits[fiveCards];
for(int i=0;i<fiveCards;i++)
{
sortFaces[i]=deck[i].getFace();
sortSuits[i]=deck[i].getSuit();
}
for(int i=fiveCards-1;i>=0;i--)
for(int j=0;j<=i-1;j++)
if(sortFaces[j]>sortFaces[j+1])
{
int t;
t=sortFaces[j];
sortFaces[j]=sortFaces[j+1];
sortFaces[j+1]=t;
}
if((sortFaces[0]==sortFaces[1]&&sortFaces[0]==sortFaces[2]&&sortFaces[0]==sortFaces[3])||
(sortFaces[1]==sortFaces[2]&&sortFaces[1]==sortFaces[3]&&sortFaces[1]==sortFaces[4]))
cout <<"There are 4 same cards." <<endl;
else if((sortFaces[0]==sortFaces[1]&&sortFaces[0]==sortFaces[2])||
(sortFaces[1]==sortFaces[2]&&sortFaces[1]==sortFaces[3])||
(sortFaces[2]==sortFaces[3]&&sortFaces[2]==sortFaces[4]))
cout <<"There are 3 same cards." <<endl;
else if(int i=duiziCards(sortFaces))
cout <<"There are " <<i <<" pairs." <<endl;
else
cout <<"There is no same cards." <<endl;
if(sortFaces[0]+1==sortFaces[1]&&sortFaces[1]+1==sortFaces[2]&&
sortFaces[2]+1==sortFaces[3]&&sortFaces[3]+1==sortFaces[4])
cout <<"The five cards is a straight." <<endl;
else
cout <<"The five cards is not a straight." <<endl;
if(sortSuits[0]==sortSuits[1]&&sortSuits[0]==sortSuits[2]&&
sortSuits[0]==sortSuits[3]&&sortSuits[0]==sortSuits[4])
cout <<"The five cards have same flower." <<endl;
else
cout <<"The five cards have different flower." <<endl;
}
int DeckOfCards::duiziCards(int* sortFaces)
{
int duiziNum=0;
for(int i=0;i<fiveCards-1;i++)
if(sortFaces[i]==sortFaces[i+1]) duiziNum++;
return duiziNum;
}
[5] main函數(shù)文件“main_FiveCards.cpp”
#include<iostream>
#include"card.cpp"
#include"deckofcards.cpp"
using namespace std;
int main()
{
DeckOfCards aDeck;
cout <<"Deal all cards before shuffle." <<endl;
aDeck.dealCard(aDeck.allCards);
aDeck.shuffle();
cout <<"Deal five cards after shuffle." <<endl;
aDeck.dealCard(aDeck.fiveCards);
cout <<"\nThe result after sorting." <<endl;
aDeck.sortCards();
return 0;
}
將5個(gè)文件放在同一目錄下,對文件“main_FiveCards.cpp”編譯運(yùn)行即可。以下是在CodeBlocks中的運(yùn)行結(jié)果:

注:如有疑問或者高見,歡迎各位讀者與筆者交流,以期共同學(xué)習(xí)進(jìn)步。
以上就是本文的全部內(nèi)容,希望對大家的學(xué)習(xí)有所幫助,也希望大家多多支持腳本之家。
相關(guān)文章
實(shí)現(xiàn)一個(gè)內(nèi)存池管理的類方法
下面小編就為大家?guī)硪黄獙?shí)現(xiàn)一個(gè)內(nèi)存池管理的類方法。小編覺得挺不錯(cuò)的現(xiàn)在就分享給大家,也給大家做個(gè)參考。一起跟隨小編過來看看吧2017-01-01
C語言植物大戰(zhàn)數(shù)據(jù)結(jié)構(gòu)堆排序圖文示例
這篇文章主要為大家介紹了C語言植物大戰(zhàn)數(shù)據(jù)結(jié)構(gòu)堆排序的圖文示例詳解,有需要的朋友可以借鑒參考下,希望能夠有所幫助,祝大家多多進(jìn)步,早日升職加薪2022-05-05
C語言實(shí)現(xiàn)簡單的控制臺(tái)三子棋游戲
這篇文章主要為大家詳細(xì)介紹了C語言實(shí)現(xiàn)簡單的控制臺(tái)三子棋游戲,文中示例代碼介紹的非常詳細(xì),具有一定的參考價(jià)值,感興趣的小伙伴們可以參考一下2020-11-11

