链式表逆向输入和顺向输入

#include<iostream>
using namespace std;
typedef struct Lnode{
struct Lnode *next;
int data;
}Lnode,*Linklist;
int Initlist(Linklist &L){
L=(Linklist)malloc(sizeof(Lnode));
if(!L)return 0;
L->next=NULL;
return 0;
}
int shun(Linklist &L,int i){
int j;
for(j=0;j<i;j++)
{Linklist S;
Initlist(S);
cin>>S->data;
S->next=L->next;
L->next=S;
}
return 0;
}
int ni(Linklist &L,int j){
int i;Linklist pa=L;
for(i=0;i<j;i++){
Linklist S;
Initlist(S);
cin>>S->data;
S->next=pa->next;
pa->next=S;
pa=S;
}
return 0;
}
int shuchu(Linklist &L){
Linklist A=L->next;
while(A){
cout<<A->data<<" ";
A=A->next;
}
return 0;
}
int main(){
Linklist L;int i;Linklist B;
Initlist(L); Initlist(B);
cout<<"================顺向输入==============="<<endl<<"请输入数字个数"<<endl;
cin>>i;
shun(L,i);
shuchu(L);cout<<endl;
cout<<"================逆向输入==============="<<endl<<"请输入数字个数"<<endl;
cin>>i;
ni(B,i);
shuchu(B);
cout<<endl;
return 0;
}