【问题标题】:CS50 inheritance lab5CS50继承实验室5
【发布时间】:2022-07-17 07:01:38
【问题描述】:

我目前正在学习 cs50 课程,并尝试了继承 lab5 问题,但在编写代码的过程中遇到了分段错误错误,我似乎真的无法理解导致此错误的原因。请我想在这个问题上获得帮助和更正,以了解究竟是什么问题以及如何避免它。

代码可以编译,但由于分段错误,其他所有任务都无法完成

// Simulate genetic inheritance of blood type

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

// Each person has two parents and two alleles
typedef struct person
{
    struct person *parents[2];
    char alleles[2];
}
person;

const int GENERATIONS = 3;
const int INDENT_LENGTH = 4;

person *create_family(int generations);
void print_family(person *p, int generation);
void free_family(person *p);
char random_allele();

int main(void)
{
    // Seed random number generator
    srand(time(0));

    // Create a new family with three generations
    person *p = create_family(GENERATIONS);

    // Print family tree of blood types
    print_family(p, 0);

    // Free memory
    free_family(p);
}

// Create a new individual with `generations`
person *create_family(int generations)
{
    // TODO: Allocate memory for new person
    person *newperson = malloc(sizeof(person));

    // If there are still generations left to create
    if (generations > 1)
    {
        // Create two new parents for current person by recursively calling create_family
        person *parent0 = create_family(generations - 1);
        person *parent1 = create_family(generations - 1);

        // TODO: Set parent pointers for current person

        newperson->parents[0] = parent0;
        newperson->parents[1] = parent1;


        // TODO: Randomly assign current person's alleles based on the alleles of their parents

        newperson->alleles[0] = parent0->alleles[rand() %2];
        newperson->alleles[1] = parent1->alleles[rand() %2];


    }

    // If there are no generations left to create
    else
    {
        // TODO: Set parent pointers to NULL
        newperson->parents[0] = NULL;
        newperson->parents[1] = NULL;

        // TODO: Randomly assign alleles
        newperson->alleles[0] = random_allele();
        newperson->alleles[1] = random_allele();

    }

    // TODO: Return newly created person
    return newperson;
    //return NULL;
}

// Free `p` and all ancestors of `p`.
void free_family(person *p)
{
    // TODO: Handle base case
    if ( p == NULL)
    {
        return;
    }

    // TODO: Free parents recursively
    free_family(p->parents[0]);
    free_family(p->parents[1]);

    // TODO: Free child
    free_family(p);
    return;

}

// Print each family member and their alleles.
void print_family(person *p, int generation)
{
    // Handle base case
    if (p == NULL)
    {
        return;
    }

    // Print indentation
    for (int i = 0; i < generation * INDENT_LENGTH; i++)
    {
        printf(" ");
    }

    // Print person
    if (generation == 0)
    {
        printf("Child (Generation %i): blood type %c%c\n", generation, p->alleles[0], p->alleles[1]);
    }
    else if (generation == 1)
    {
        printf("Parent (Generation %i): blood type %c%c\n", generation, p->alleles[0], p->alleles[1]);
    }
    else
    {
        for (int i = 0; i < generation - 2; i++)
        {
            printf("Great-");
        }
        printf("Grandparent (Generation %i): blood type %c%c\n", generation, p->alleles[0], p->alleles[1]);
    }

    // Print parents of current generation
    print_family(p->parents[0], generation + 1);
    print_family(p->parents[1], generation + 1);
}

// Randomly chooses a blood type allele.
char random_allele()
{
    int r = rand() % 3;
    if (r == 0)
    {
        return 'A';
    }
    else if (r == 1)
    {
        return 'B';
    }
    else
    {
        return 'O';
    }
}


【问题讨论】:

  • 启动您最喜欢的调试器并找到确切的线路崩溃。然后检查崩溃中涉及的所有变量的值,看看哪个是可疑的。过度递归 = 堆栈溢出也可能导致 Seg 错误。
  • free_family 是错误的/不完整的 - 它无限递归,这可能是 seg 错误的原因,您实际上并没有做任何事情来释放内存,也没有清空指针以便您不要不要无意中再次使用它们。

标签: c segmentation-fault cs50


【解决方案1】:

free_family 中的无限递归很可能是 seg 错误的原因。

您实际上并没有释放与该人相关的内存。

请注意,将指针设置为 null 是一种很好的做法,这样您就知道它现在是一个无效的指针。您可能需要将签名修改为 person ** 以允许您在函数中对其进行修改。

// Free `p` and all ancestors of `p`.
void free_family(person *p)
{
    // TODO: Handle base case
    if ( p == NULL)
    {
        return;
    }

    free_family(p->parents[0]);
    free_family(p->parents[1]);

    free_family(p);
  //^^^^^^^^^^^^^^^ this is infinitely recursive
    return;

}

解决方案:

void free_family(person **p)
{
    // TODO: Handle base case
    if ( *p == NULL)
    {
        return;
    }

    // TODO: Free parents recursively
    free_family(&(*p)->parents[0]);
    free_family(&(*p)->parents[1]);

    // TODO: Free child
    free(*p);
    *p = NULL;
    return;

}

像这样使用:

int main(void)
{
    // Seed random number generator
    srand(time(0));

    // Create a new family with three generations
    person *p = create_family(GENERATIONS);

    // Print family tree of blood types
    print_family(p, 0);

    // Free memory
    free_family(&p);
}

【讨论】:

    【解决方案2】:
     // TODO: Free child
        free_family(p);
        return;
    

    在这一部分中,您将递归地释放孩子,而您需要做的只是释放孩子一次。你需要做的是:

    // TODO: Free child
        free(p);
        return;
    

    就是这样。 祝你有美好的一天!

    【讨论】:

      猜你喜欢
      • 2021-08-24
      • 1970-01-01
      • 1970-01-01
      • 1970-01-01
      • 2013-10-25
      • 2016-03-31
      • 1970-01-01
      • 2013-01-21
      • 1970-01-01
      相关资源
      最近更新 更多