#include <iostream>
using namespace std;
#include <malloc.h>
//不带头节点的单链表
typedef struct Lnode{
int data;
struct Lnode *next;
}Lnode,*Linklist;
bool initlinklist(Linklist &L){
L=(Lnode *)malloc(sizeof(Lnode));
L=NULL;
}
bool head_insert(Linklist &L){
Lnode *s=(Lnode *)malloc(sizeof(Lnode));
int i =1;
int val;
cout<<"请输入第"<<i<<"个数"<<endl;
cin>>val;
while(val!=-1){
s->data=val;
s->next=L;
L=s;
i++;
cout<<"请输入第"<<i<<"个数"<<endl;
cin>>val;
}
}
void printlinklist(Linklist &L){
Lnode *p=L;
while(p!=NULL){
cout<<p->data<<endl;
p=p->next;
}
}
int main(){
Lnode *L;
initlinklist(L);
head_insert(L);
printlinklist(L);
return 0;
}
12-19
08-05
08-05
08-05