C语言数据结构——链表

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

struct Student
{
  char name[20];//姓名
  int id;//学号
  struct Student* next;//指向下一个节点的指针
};

int count;//表示链表长度

struct Student* create()
{
  struct Student* head = NULL;//初始化链表的头指针
  struct Student* end, * new;
  count = 0;//初始化链表长度

  end = new = (struct Student*)malloc(sizeof(struct Student));//动态分配内存空间
  printf("请输入姓名，学号\n");
  scanf("%s", &new->name);
  scanf("%d", &new->id);
  while (new->id != 0)
  {
    count++;
    if (count == 1)
    {
      new->next = head;//使得指向为空
      end = new;//跟踪新加入的节点
      head = new;//头指针指向首节点
    }
    else
    {
      new->next = NULL;//新节点的指向为空
      end->next = new;//原来的为节点指向新节点
      end = new;//end指向新节点
    }

    new = (struct Student*)malloc(sizeof(struct Student));//再次动态分配节点的内存空间
    scanf("%s", &new->name);
    scanf("%d", &new->id);

  }
  free(new);//释放空间
  return head;
};

void show(struct Student* head) {
  struct Student *temp;
  int index = 1;
  printf("有%d位学生:\n",count);
  temp = head;
  while (temp != NULL)
  {
    printf("第 %d 位学生的姓名是：%s，学号是：%d \n", index, temp->name, temp->id);
    temp = temp->next;
    index++;
  }
}

int main() {
  struct Student* head;//定义头结点
  head = create();//创建节点
  show(head);//输出链表
  return 0;
}