從文件讀取時創建 C 字符串數組

Question

我正在做一個項目，我需要管理各種隊列，特別是洗車場中的汽車。 我在網上找到了一些代碼，允許您使用 integer 輸入添加到隊列並對其進行管理。 有沒有辦法讓我重新編寫這段代碼，以便它接受輸入為 c 字符串而不是整數？

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

struct node
{
    int data;
    struct node *next;
};

struct node *front = NULL;
struct node *rear = NULL;

void display();
void enqueue(int);
void dequeue();

int main()
{
    int n, ch;
    do
    {
        printf("\n\nQueue Menu\n1. Add \n2. Remove\n3. Display\n0. Exit");
        printf("\nEnter Choice 0-3? : ");
        scanf("%d", &ch);
        switch (ch)
        {
            case 1:
                printf("\nEnter number ");
                scanf("%d", &n);
                enqueue(n);
                break;
            case 2:
                dequeue();
                break;
            case 3:
                display();
                break;
        }
    }while (ch != 0);
}

void enqueue(int item)
{
    struct node *nptr = malloc(sizeof(struct node));
    nptr->data = item;
    nptr->next = NULL;
    if (rear == NULL)
    {
        front = nptr;
        rear = nptr;
    }
    else
    {
        rear->next = nptr;
        rear = rear->next;
    }
}

void display()
{
    struct node *temp;
    temp = front;
    printf("\n");
    while (temp != NULL)
    {
        printf("%d\t", temp->data);
        temp = temp->next;
    }
}

void dequeue()
{
    if (front == NULL)
    {
        printf("\n\nqueue is empty \n");
    }
    else
    {
        struct node *temp;
        temp = front;
        front = front->next;
        printf("\n\n%d deleted", temp->data);
        free(temp);
    }
}

所需的輸入將是這些字符串之一；

AV96888 VW alm
KD65656 Audi luksus
AX21878 Ford alm
CN32323 VW alm
NB21214 Ford luksus
UM21878 Ford alm
AV54361 Tesla luksus

Answer 1

是的，數據存儲在節點中：

struct node
{
    int data;
    struct node *next;
};

所以你只需要改變int data; 到一個字符串。

Answer 2

您在 C 而不是 c++ 中這樣做是否有原因？ 在那里，字符串管理更容易。

Answer 3

這是答案，您只需將數據轉換為 char * 並使用 strdup 存儲指針

#include "stdlib.h"
#include "stdio.h"
#include "string.h"

struct node
{   
    char *data; 
    struct node *next;
};

struct node *front = NULL;
struct node *rear = NULL;

void enqueue(char *item)
{
    struct node *nptr = malloc(sizeof(struct node));
    nptr->data = strdup(item);
    nptr->next = NULL;
    if (rear == NULL)
    {
        front = nptr;
        rear = nptr;
    }
    else
    {
        rear->next = nptr;
        rear = rear->next;
    }
}

void display()
{
    struct node *temp;
    temp = front;
    printf("\n");
    while (temp != NULL)
    {
        printf("%s\t", temp->data);
        temp = temp->next;
    }
}


void dequeue()
{
    if (front == NULL)
    {
        printf("\n\nqueue is empty \n");
    }
    else
    {
        struct node *temp;
        temp = front;
        front = front->next;
        printf("\n\n%d deleted", temp->data);
        free(temp->data);
        free(temp);
    }
}

int main()
{
    int ch;
    char n[256];

    do {
        printf("\n\nQueue Menu\n1. Add \n2. Remove\n3. Display\n0. Exit");
        printf("\nEnter Choice 0-3? : ");
        scanf("%d", &ch);
        switch (ch)
        {
            case 1:
                printf("\nEnter a name: ");
                scanf("%s", n);
                enqueue(n);
                break;
            case 2:
                dequeue();
                break;
            case 3:
                display();
                break;
        }
    }while (ch != 0);
}