单链表倒叙插入(基于先构造尾部的思路)

#include<bits/stdc++.h>
using namespace std;
//链表
typedef struct LNode
{
    int data;
    struct LNode* next;
}* LinkList;

void CreateList_L(LinkList& L, int n)
{
    int sumn = n;
    LinkList p = NULL;//构造链表尾部供插入
    while(n--)
    {
        LinkList temp;
        temp = (struct LNode*)malloc(sizeof(LNode));
        scanf("%d",&(temp->data));
        temp->next = p;//优先考虑temp-next的连接
        p = temp;
    }
    L = (struct LNode*)malloc(sizeof(LNode));
    L->data = sumn;
    L->next = p;
}
void ReadList_L(LinkList& L)
{
    LinkList p = L;
    while(p)
    {
        cout<<p->data<<" ";
        p = p->next;
    }
}
int main()
{
    LinkList L;
    int n = 10;
    CreateList_L(L,n);//1 2 3 4 5 6 7 8 9 10(输入样例)
    ReadList_L(L);
    return 0;
}

``