初始链表

#include<stdio.h>
#include<malloc.h>
typedef struct s
{
    int data;
    struct s*n;
}d;
d*create(int n)
{
    int i, a;
    d*p1 = NULL;
    d*p2 = NULL;
    d*head = NULL; 
    printf("输入所有数:");
    for (i = 0; i < n; i++)
    {
        p1 = (d*)malloc(sizeof(d));
        scanf_s("%d", &a);
        p1->data = a;
        if (head == NULL)
        {
            head = p1;
            p2 = p1;
        }
        else
        {
            p2->n = p1;
            p2 = p1;
        }
    }
    p2->n=NULL;
    return head;
}
void main()
{
    int n;
    d*p;
    printf("创建链表点数：");
    scanf_s("%d", &n);
    p = create(n);
    printf("结果");
    while (p)
    {
        printf("%4d", p->data);
        p = p->n;
    }
    
    getchar();
    getchar();
}