A-顺序建立链表

#include<stdio.h>
#include<stdlib.h>
typedef struct LNode
{
    int data;
    struct LNode *next;
}LNode, *LinkList;
void CreateList(LinkList &L, int n)
{
    L = (LinkList)malloc(sizeof(LNode));
    L->next = NULL;
    LinkList p, q;
    q = L;
    for(int i = 0; i < n; i ++)
    {
        p = (LinkList)malloc(sizeof(LNode));
        scanf("%d", &p->data);
        p->next = NULL;
        q->next = p;
        q = p;
    }
    p = L->next;
    while(p)
    {
        if(p->next)
            printf("%d ", p->data);
        else
            printf("%d\n", p->data);
        p = p->next;
    }
}
int main()
{
    int n;
    LinkList L;
    scanf("%d", &n);
    CreateList(L, n);
    return 0;
}