#include
#include
struct node
{
int data;
struct node next;
};
node create(node* head,int sl)
{ int shu;
node *p;
p=head;
for(int i=0;i
{
node *q;
q=(node*)malloc(sizeof(node));
q->next=NULL;
printf("请输入结点的值:");
scanf("%d",&num);
q->data=shu;
p->next=q;
p=q;
} return head;
}
void out(node *head)
{
node *p;
p=head->next;
while(p!=NULL)
{
printf("%d\n",p->data);
p=p->next;
}
}
node *insert(node *head,int wz,int shu)
{
node *p,q;
int j=0;
p=head;
while(j
p=p->next;
j++;
}
q=(node
q->data=shu;
q->next=p->next;
p->next=q;
return 0;
}
int main()
{
int sl=5,jd=4,x;
node head;
head=(node)malloc(sizeof(node));
create(head,sl);
printf("老链表为");
out(head);
printf("请输入要插入的值");
scanf("%d",&x);
insert(head,jd,x);
printf("新链表为");
out(head);
}
哪个是第8行呢?