I would rather ()they next week. A.comeB.cameC.will comeD.shall come
I would rather ()they next week.
A.come
B.came
C.will come
D.shall come
相关考题：
A: Would you like to go to the cinema with me?B: I’d _____________ stay at home.A. likeB. preferC. rather
I ()have been here, but I()not find the time.A. could; couldB. might; couldC. should; couldD. should; would
执行下列语句后指针及链表的示意图为(43)。L = (LinkList) malloc ( sizeof (LNode) );P = L;for(i =0;i ＜=3;i ++) {P→next = (LinkList) malloc (sizeof (LNode));P = P→next;P→data = i * i + 1;}A．B．C．D．
●试题二阅读下列函数说明和C代码，将应填入(n)处的字句写在答题纸的对应栏内。【说明】该程序运行后，输出下面的数字金字塔【程序】includestdio．hmain (){char max，next；int i；for(max=′1′；max=′9′；max＋＋){for(i=1；i=20- (1) ；＋＋i)printf(" ")；for(next= (2) ；next= (3) ；next＋＋)printf("％c"，next)；for(next= (4) ；next= (5) ；next--)printf("％c"，next)；printf("＼n")；}}
—The boss wants to talk to you．He seems unhappy with your performance．—Oh,I?be in trouble．I hope he won′t fire me．A.MustB.canC.ShouldD.would
在KMP模式匹配中，用next数组存放模式串的部分匹配信息。当模式串位j与目标串位i比较时，两字符不相等，则j的位移方式是（）。A．i=next[j]B．i不变C．j不变D．j=next[j]
在KMP模式匹配中，用next数组存放模式串的部分匹配信息。当模式串位j与目标串位i比较时，两字符不相等，则i的位移方式是（）。A．i=next[j]B．i不变C．.j不变D．j=next[j]
L1是不带头结点的单链表。以下算法功能是什么？ Status fun（LinkList L1, LinkList L2) {p=L1; n=0; while（p){n++; p=p-＞next;} p=L1; for（i=1;i＜n/2;i++)p=p-＞next; L2=p-＞next; p-＞next=NULL; return OK; }