如何根据这些说明加载一副纸牌？ C

Question

These are the instructions my professor gave me for a Lab in C

--SOLVED--

struct singlecard
{
  int cardnum;
  char face;
  char suit;
};

Your program must have the functions named as follows:

Main() - Calls "LoadDeck()" and "DealCards()."

LoadDeck() will fill just the "cardnum" of the array with a unique number between 1 and 52. It will do this by selecting a random number and then calling the function "CheckDup()" to see if the number is a duplicate. It will then call "LoadFace()" and "LoadSuit()."

CheckDup() will receive the trial number and the deck of cards as input, and will return back a Boolean.

LoadFace() will go through the deck and put the appropriate value in "face" of the array by using just the "cardnum" the modulus operator to extract the value from the string "A23456789TJQK."

LoadSuit() will go through the deck and put the appropriate suit value in "suit" by using a method similar to "LoadFace()" where the suit string is "HDCS."

DealCards() will display the cards.

**My question is, how can I check that there are no duplicate faces in each suit without a ton of if statements? Please disregard the fact that I'm not sending the "cardnum" as a parameter to the functions LoadFace and LoadSuit, Also I'm using srand(1) for debugging purposes. So far the output has unique card number and the correct amount of faces and suits (13, 4), but I'm not sure how I can insert a nonduplicate element from here.Any advice would be helpful. Also, a simple assign and shuffle of an array isn't allowed :( **

EDIT checkDup and LoadDeck currently load the deck with a unique card number but not a unique card face and suit. It just counts the number of A faces 2 faces 3 faces King faces etc. It also makes sure that there are 13 cards in each suit. I want to insert unique faces and suits into the stuct array so that I don't have say two 7 of spades.

#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
#include <time.h>


struct singlecard {
    int cardnum;
    char face;
    char suit;
};


int i, deckSize = 52;
char suits[] = {"HDCS"};
char faces[] = {"A23456789TJQK"};


void DealCards(struct singlecard Deck[]) {

    //SortCards();
    printf("\n\n");
    for (i = 0; i < deckSize; i++) {
        if ((i + 1) % 4 == 0) {
            printf("[%d %c-%c]  %d\n", Deck[i].cardnum, Deck[i].face, Deck[i].suit, i + 1);
        } else {
            printf("[%d %c-%c] ", Deck[i].cardnum, Deck[i].face, Deck[i].suit);
        }
    }

}

int CheckDupe(struct singlecard Deck[],int n) {

    int check = 0, j;
    for (j = 0; j < deckSize; j++) {
        if (n == Deck[j].cardnum || n == 0) {
           return check = 1;
        }

    }
    return check;

}

void LoadSuit(struct singlecard Deck[],int n) 
{  
        Deck[i].suit = suits[(n-1) % 4];
}

void LoadFace(struct singlecard Deck[],int n) {

        Deck[i].face = faces[(n-1) % 13];

} 
void LoadDeck(struct singlecard Deck[]){

    srand(time(NULL));

    for (i = 0; i < deckSize;) {
        int random_number = rand() % 53;
        if (CheckDupe(Deck,random_number) == 0) {

            Deck[i].cardnum = random_number;
            LoadFace(Deck,Deck[i].cardnum);
            LoadSuit(Deck,Deck[i].cardnum);
            i++;
        }
    }   
}

int main(){
    struct singlecard Deck[52];
    LoadDeck(Deck);
    DealCards(Deck);
    return 0;
}

Current Output

[5 5-H] [36 T-S] [6 6-D] [29 3-H]  4
[12 Q-S] [19 6-C] [25 Q-H] [13 K-H]  8
[42 3-D] [38 Q-D] [14 A-D] [22 9-D]  12
[16 3-S] [40 A-S] [51 Q-C] [35 9-C]  16
[24 J-S] [4 4-S] [20 7-S] [43 4-C]  20
[31 5-C] [9 9-H] [11 J-C] [48 9-S]  24
[49 T-H] [18 5-D] [41 2-H] [21 8-H]  28
[50 J-D] [52 K-S] [3 3-C] [27 A-C]  32
[39 K-C] [8 8-S] [33 7-H] [23 T-C]  36
[44 5-S] [17 4-H] [32 6-S] [45 6-H]  40
[30 4-D] [28 2-S] [2 2-D] [7 7-C]  44
[26 K-D] [34 8-D] [15 2-C] [47 8-C]  48
[10 T-D] [37 J-H] [1 A-H] [46 7-D]  52

Answer 1

The problems you are facing is because you've not read and followed your homework instructions properly, notably this bit:

LoadFace() will go through the deck and put the appropriate value in "face" of the array by using just the "cardnum" the modulus operator to extract the value from the string "A23456789TJQK."

Imagine you've listed out each card in order like so with the card number.

 1. Ace of Hearts
 2. Two of Hearts
 ....
 14. Ace of Diamonds
 15. Two of Diamonds

Do you notice a pattern? Every 13th card has the same face. The modulus operator (aka % ) can be used to find out which of those 13 faces a specific value of cardnum relates to like this. cardnum % 13 will always be between 0 and 12. Because your first card starts at 1, you need to subtract 1 first before doing getting modulus. Your LoadFace function then becomes this.

void LoadFace() {
    for (i = 0; i < deckSize;) {
        Deck[i].face = faces[(Deck[i].cardnum-1) % 13];
    }
}

If you want to know if two cards have the same face based on their cardnum you can just compare Deck[a].cardnum % 13 and Deck[b].cardnum % 13 .

So long as you don't put the same cardnum in twice, you know your deck will always contain unique cards.

Answer 2

CheckDup will receive the trial number and the deck of cards as input, and will return back a Boolean.

which would translate to the following declaration

bool CheckDup( const int trial, const struct singlecard deck[], const unsigned int deckSize );

And should check the deck if the trial card do not exists yet ( probably true if a duplicate is found ), probably by iterating through the deck .

Answer 3

This is what I understood from your question.

you want to find out, using checkDup() if that card has already been dealt

you could maintain an array (or list whatever) of the card numbers that have been dealt. Then simply search through that array every time checkDup is called.