从.txt文件创建一个单链列表，并反转C中每行的奇数

穆斯塔法·伊尔马兹（MustafaYılmaz）

我有一个有关链表的项目，但是很难。老师要我阅读.txt文件并从中创建单链接列表。之后，我需要反转每行的奇数。然后打印。这是我用于打印链表的代码。但是我需要帮助反转每行的奇数。

这是我用来打印列表的代码：

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

struct list {
    char *string;
    struct list *next;
};

typedef struct list LIST;

int main(void) {
    FILE *fp;
    char line[10];
    LIST *current, *head;

    head = current = NULL;
    fp = fopen("data.txt", "r");

    while(fgets(line, sizeof(line), fp)){
        LIST *node = malloc(sizeof(LIST));
        node->string = strdup(line);
        node->next =NULL;

        if(head == NULL){
            current = head = node;
        } else {
            current = current->next = node;
        }
    }
    fclose(fp);
    
    for(current = head; current ; current=current->next){
        printf("%s", current->string);
    }
    
    return 0;
}

这是.txt文件的内容：

10
9,6,11,7,12,18,19,14,15,13
13,14,9,12,15,3,18,20,1,2
4,11,8,17,12,15,20,10,3,16
19,4,11,1,13,17,12,16,20,18
1,6,20,11,13,9,7,16,10,2
12,4,11,16,3,20,9,19,17,15
20,3,10,12,18,2,5,14,15,16
18,19,15,2,6,9,1,3,17,4
7,6,20,1,11,4,3,5,8,16
1,2,16,13,17,10,12,9,4,15

苏瓦吉·帕特拉

希望这段代码能完成这项工作。

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

typedef struct line {
    struct num *first;
    struct line *next;
} LineNode;

typedef struct num {
    int num;
    int order;
    struct num *next;
} NumNode;

int main() {
    FILE *fp;
    char ch;
    int counter = 0;
    NumNode *curr_num, *even_ptr, *odd_ptr, *odd_head, *even_head;
    LineNode *curr_line, *line_head;

    curr_num = even_head = odd_head = even_ptr = odd_ptr = NULL;
    line_head = curr_line = NULL;
    fp = fopen("data.txt", "r");

    if (fp == NULL)
    {
        return 1;
    }
    
    ch = fgetc(fp);
    while(ch != EOF){
        if (ch >= 48 && ch <= 57)
        {
            int n = 0;
            while (ch != EOF && ch != '\n' && ch >= 48 && ch <= 57)
            {
                int x = ch - 48;
                n = n * 10 + x;
                ch = fgetc(fp);
            }
            NumNode *node = malloc(sizeof(NumNode));
            node->num = n;
            node->order = counter;
            node->next =NULL;

            if (n % 2 == 0){
                if(even_head == NULL){
                    even_head = even_ptr = node;
                } else {
                    even_ptr = even_ptr->next = node;
                }
            }else{
                if(odd_head == NULL){
                    odd_head = node;
                } else {
                    node->next = odd_head;
                    odd_head = node;
                }
            }

            counter++;
        }
        

        if (ch == '\n' || ch == EOF)
        {
            NumNode *num_node, *head;
            num_node  = head = NULL;
            even_ptr = even_head;
            odd_ptr = odd_head;
            counter = 0;

            if (even_head != NULL && even_head->order == counter){
                head = num_node = even_ptr;
                even_ptr = even_ptr->next;
            } else {
                head = num_node = odd_ptr;
                odd_ptr = odd_ptr->next;
            }
            
            counter++;

            while (even_ptr != NULL)
            {
                if (even_ptr->order == counter) {
                    num_node = num_node->next = even_ptr;
                    even_ptr = even_ptr->next;
                } 
                else if (odd_ptr != NULL) {
                    num_node = num_node->next = odd_ptr;
                    odd_ptr = odd_ptr->next;
                }

                counter++;
            }

            while (odd_ptr != NULL)
            {
                num_node = num_node->next = odd_ptr;
                odd_ptr = odd_ptr->next;
            }
            
            
            LineNode *node = malloc(sizeof(LineNode));
            node->next =NULL;
            node->first = head;
            if (line_head == NULL)
                line_head = curr_line = node;
            else
                curr_line = curr_line->next = node;

            odd_head = even_head = NULL;
            counter = 0;
        }

        ch = fgetc(fp);
    }
    fclose(fp);

    for(curr_line = line_head; curr_line != NULL ; curr_line=curr_line->next) {
        for(curr_num = curr_line->first; curr_num != NULL ; curr_num=curr_num->next) {
            printf("%d", curr_num->num);
            if (curr_num->next != NULL)
                printf(",");
        }
        printf("\n");
    }
    
    return 0;
}

本文收集自互联网，转载请注明来源。

如有侵权，请联系 [email protected] 删除。