思路来自《算法笔记》
#include<cstdio>
#include<cstdlib>
using namespace std;
struct node{
int data;
node *next;
};
node* createnode( ){//尾插法来创建单链表
node *head;
node *pre,*p;
head=new node;
head->data =666;
head->next = NULL;
pre=head;//可以用pre来操作head
for(int i=1;i<=10;i++){
p = new node;
p->data =i;
p->next =NULL;
pre->next =p;
pre = p;
}
return head;
}
int main(){
node *x=createnode();
while(x!=NULL){//输出链表
printf("%d ",x->data);
x = x->next ;
}
return 0;
}