A、p->next=head->next; head->next=p;
B、p->next=head->next; head=p;
C、p->next=head; head=p;
D、p->next=head; p= head;
A、p→link=p→link→link;
B、p=p→link;
C、p=p→link→link;
D、p→link=p;
A、p = q->next ; p->next = q->next;
B、p = q->next ; q->next = p;
C、p = q->next ; q->next = p->next;
D、q->next = q->next->next; q->next = q;
#include
struct node
{ int data;
struct node *next;
};
int min(struct node *first)/*指针first为链表头指针*/
{ strct node *p; int m;
p=first->next; m=p->data;p=p->next;
for(;p!=NULL;p=_[20]_______)
if(p->datadata;
return m;
}
include <stdio.h>
struct node
{ int data;
struct node *next;
};
int min(struct node *first)/*指针first为链表头指针*/
{ struct node *p; int m;
p=first->next; re=p->data; p=p->next;
for(;p!=NULL;p=【 】)
if(p->data<m ) re=p->data;
return m;
}
为了保护您的账号安全,请在“简答题”公众号进行验证,点击“官网服务”-“账号验证”后输入验证码“”完成验证,验证成功后方可继续查看答案!