网友您好， 请在下方输入框内输入要搜索的题目：
题目内容
（请给出正确答案）
I have ( )my trip to Japan until next month.
A.put off
B.put up with
C.put on
D.put down
参考答案
更多 “ I have ( )my trip to Japan until next month. A.put offB.put up withC.put onD.put down ” 相关考题
考题
Using "I" or "My' instead of "most people" or "our group" ______ message credibility.A decreasesB increasesC has no effect onD distortsE A and B
考题
A: Would you like to come to ( )shop one day? B: Yes, I'd love to. Thank you.
A. myselfB. meC. my
考题
I, my, will, true, come, hope, dream__________________________________________________________________________.
考题
3． —Come and join us，Jimmy !—I-m sorry，but I-m really busy now．lf I _______ time，l would certainly go．A． will haveB． have hadC． hadD． have
考题
●试题二阅读下列函数说明和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")；}}
考题
在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; }
热门标签
最新试卷