通过引用传递链表的结构

Question

我正在完成一个需要为纸牌游戏实现链接列表的最终项目。庄家手和闲家手都应该是链表以及一副牌。

我遇到的问题是，当我尝试创建一个将值（来自套牌列表末尾的卡片）添加到它的函数时。将列表传递给它自己及其尾部不会更新它们的值。我可以使函数返回头指针，但是我将无法记下它的尾巴。

我真的很抱歉，因为这对我来说是新事物，而且我在这门课程之前从未编程过。如果我的函数中的某些逻辑看起来不必要地难以阅读，或者直接没有意义，请原谅我。

我已经无休止地尝试让这项工作发挥作用，但我觉得我做的事情根本上是错误的

typedef struct card_s { 
    char suit[20]; 
    int face; 
    struct card_s *next, *previous; 
} card;

card* createHands(card* head, card *cards) {
    card *tail = NULL, *temp = NULL, *temp1;

    // Go to end of deck
    while (cards->next != NULL) {
        cards = cards->next;
        }

        temp = (card *)malloc(sizeof(card));
        strcpy(temp->suit, cards->suit);
        temp->face = cards->face;
        if (head == NULL) { // If the list for the hand doesn't exist, create head
            head = temp;
        }
        else {
            tail->next = temp;
        }
            tail = temp;
            tail->next = NULL;

        temp1 = cards->previous; 
        free(cards); // to delete the node added from the deck

        cards = temp1;
        cards->next = NULL;
        while (cards->previous != NULL) {
            cards = cards->previous;
        }

    return head;

}

显然，这只会将我给它的任何值添加到以前的值之上。这绝不是一个连接列表。

我将不胜感激！

Answer 1

您的代码中有几个明显的问题：

• while (cards->next != NULL) 假设 cards 不为 NULL
• 如果 head 不为 NULL，则您执行 tail->next = temp; 但 tail 为 NULL
• 您从 cards 中释放了最后一个单元格而不更新该列表，因此它的最后一个元素现在被释放了

---

如果我很好理解 createHands 的第二个参数是套牌，以及提取其最后一张牌以将其添加到庄家/玩家列表中并返回它的新头像的目标。 p>

请注意，您需要将牌组设为card ** 才能在提取最后一张牌时将该列表设置为 NULL。也可以对庄家/玩家列表采用相同的方式，但显然您更喜欢返回新的头像而不是将第一个参数设置为 card ** head。

假设卡片必须加在头上，一个解决方案可以是：

card * createHands(card * head, card ** deck) {
  if (deck == NULL)
    // no available card
    return head;

  // Go to end of deck
  while ((*deck)->next != NULL) {
    deck = &(*deck)->next;
  }

  card * c = *deck; // the extracted card

  *deck = NULL; // remove it from the deck

  c->previous = NULL;

  if (head != NULL) {
    c->next = head;
    head->previous = c;
  }

  return c;
}

---

要检查的完整程序：

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

typedef struct card_s { 
    char suit[20]; 
    int face; 
    struct card_s *next, *previous; 
} card;

card * createHands(card * head, card ** deck) {
  if (deck == NULL)
    // no available card
    return NULL;

  // Go to end of deck
  while ((*deck)->next != NULL) {
    deck = &(*deck)->next;
  }

  card * c = *deck; // the extracted card

  *deck = NULL; // remove it from the deck

  c->previous = NULL;

  if (head != NULL) {
    c->next = head;
    head->previous = c;
  }

  return c;
}

// check

card * mk(const char * s, card * n)
{
  card * c = malloc(sizeof(card));

  strcpy(c->suit, s);
  c->next = n;

  if (n != 0)
    n->previous = c;

  return c;
}

void pr(const char * who, card * c)
{
  printf("%s cards :", who);
  while (c != NULL) {
    printf(" %s", c->suit);
    c = c->next;
  }
  putchar('\n');
}

int main()
{
  card * deck = mk("one", mk("two", mk("three", mk("four", mk("five", NULL)))));
  card * dealer = NULL;
  card * player = NULL;

  pr("deck", deck);

  puts("->dealer");
  dealer = createHands(dealer, &deck);
  pr("deck", deck);
  pr("dealer", dealer);

  puts("->player");
  player = createHands(player, &deck);
  pr("deck", deck);
  pr("player", player);

  puts("->dealer");
  dealer = createHands(dealer, &deck);
  pr("deck", deck);
  pr("dealer", dealer);

  puts("->player");
  player = createHands(player, &deck);
  pr("deck", deck);
  pr("player", player);

  puts("->dealer");
  dealer = createHands(dealer, &deck);
  pr("deck", deck);
  pr("dealer", dealer);

  return 0;
}

编译和执行：

pi@raspberrypi:/tmp $ gcc -pedantic -Wextra -Wall -g l.c
pi@raspberrypi:/tmp $ ./a.out
deck cards : one two three four five
->dealer
deck cards : one two three four
dealer cards : five
->player
deck cards : one two three
player cards : four
->dealer
deck cards : one two
dealer cards : three five
->player
deck cards : one
player cards : two four
->dealer
deck cards :
dealer cards : one three five

Answer 2

对函数的功能做了很多假设

typedef struct card_s { 
    char suit[20]; 
    int face; 
    struct card_s *next, *previous; 
} card;

你想加一张手牌

card* AddCard(card* hand, card* draw) {
    // check input
    if(draw == NULL ) {return NULL;} 

    // create a copy of the card
    card* newCard=malloc(sizeof(card));
    if(newCard == NULL) {return hand;} // check malloc result
    memcpy(newCard, draw, sizeof(card));
    newCard->next=NULL;
    newCard->previous=NULL;

    if(hand==NULL) {return newCard;} // if the hand was null just return the card

    // find where to append the card
    card* tail=hand; 
    while(tail->next != NULL) {tail = tail->next;}
    // append the card to the end of the hand
    tail->next = newCard;
    newCard->previous = tail;
    return hand;
}