计算机原理之c语言实现链表

来源：互联网发布：hive sql 编辑：程序博客网时间：2024/06/17 02:57
#include <stdio.h>  #include <stdlib.h>  struct Node  {      int data;      struct Node * next;  };  //建立只含头结点的空链表  struct Node * create_list()  {      struct Node * head = NULL;      head = (struct Node *)malloc(sizeof(struct Node));      if (NULL == head)      {          printf("memory out of use/n");          return NULL;      }      head->next = NULL;      head->data = 0;      return head;  }  //尾插法建立链表  int insert_form_tail(struct Node * head, int num)  {      struct Node * temp = head;      struct Node * new_node = NULL;      new_node = (struct Node *)malloc(sizeof(struct Node));      if (NULL == new_node)      {          printf("memory out of use/n");          return -1;      }      //寻找尾结点      while (temp->next != NULL)      {          temp = temp->next;      }      //将新结点插入到链表的最后      new_node->data = num;      new_node->next = NULL;      temp->next = new_node;      return 0;  }  //打印链表  int show_list(struct Node * head)  {      struct Node * temp;      temp = head->next;      while(temp)      {          printf("%d/n",temp->data);          temp = temp->next;      }      return 0;  }  int main(int argc, char* argv[])  {      struct Node * head;      head = create_list();      if (NULL == head)          printf("create_list error/n");        insert_form_tail(head,123);      insert_form_tail(head,456);      show_list(head);      }
0 0