利用数组初始化链表

#include<stdio.h> #include<stdlib.h> typedef struct Node{ int data; struct Node *next; }Node; Node *head(int a[]){//将数组变为链表，返回链表的头指针 Node *L,*current,*p; int i=0; L = (Node*)malloc(sizeof(Node)); current = L; L->next = NULL; while(a[i]!='\0'){ p = (Node*)malloc(sizeof(Node)); p->data = a[i]; current->next = p; current = p; ++i; } current->next = NULL; return L; } int main(void){

        //话不多说，验证一下这个方法 int x[1024]={1,2,3,9,9,6};//随便搞一个数组 Node *L,*p; L = head(x);//将数组变为链表，返回链表的头指针 p = L->next;//从开始结点的信息开始打印 while(p!=NULL){ printf("%d\n",p->data); p = p->next; } return 0; }

效果如图所示