设存在一个带头结点的单循环链表L,每个结点包含三个域,它们分别是prior、data和next。其中data为数
A.s=rear;rear=rear->link;deletes;
B.rear=rear->link;deleterear;
C.rear=rear->link->link;deleterear;
D.s=rear->link->link;rear->link->link=s->link;deletes;
#include
#include
void fun(char *s[],int n)
{ char *t; int i,j;
for(i=0;i
for(j=i+1;j
if(strlen(s[i])>strlen(s[j])) {t=s[i];s[i]:s[j];s[j]=t;}
}
main()
{ char *ss[]={"bcc","bbcc","xy","aaaacc","aabcc"};
fun(ss,5); printf("%s,%s\n",ss[0],ss[4]);
}
程序的运行结果是
A.xy,aaaacc
B.aaaacc,xy
C.bcc,aabcc
D.aabcc,bcc
A、p->next->prev=p->prev;p->prev->next=p->next;free(p);
B、p->next->prev=p->next;p->prev->next=p->next;free(p);
C、p->next->prev=p->next;p->prev->next=p->prev;free(p);
D、p->next->prev=p->prev;p->prev->next=p->prev;free(p);
A、head->next
B、head
C、NULL
D、p
为了保护您的账号安全,请在“简答题”公众号进行验证,点击“官网服务”-“账号验证”后输入验证码“”完成验证,验证成功后方可继续查看答案!