网友您好， 请在下方输入框内输入要搜索的题目：
题目内容
（请给出正确答案）
I __________ your house last night at about 12:00, so I didn ’t call you.
A.passed on
B.passed from
C.passed to
D.passed by
参考答案
更多 “ I __________ your house last night at about 12:00, so I didn ’t call you. A.passed onB.passed fromC.passed toD.passed by ” 相关考题
考题
()you()Jane last month? B: No, I().
A、*/saw/didn’tB、Did/see/didn’tC、Did/saw/didn’tD、id/see/did
考题
I () you as soon as I () in Shanghai.
A、call; arriveB、will call; arriveC、call; will arriveD、will call; will arrive
考题
I’m meeting Ivan tonight. I ____ a Russian before.
A. didn’t ever meetB.have never metC.have ever metD.never met
考题
I’d rather you ____ come here to see the film. It’s really long and boring.
A. haven’tB. don’tC. didn’tD. hadn’t
考题
I’dratheryou________makeanycommentontheissueforthetimebeing.A)don’tB)wouldn’tC)didn’tD)shouldn’t
考题
-- Ann is in hospital.-- Oh, really? I __ know. I __ go and visit her.A. didn’t; am going to B. don’t; wouldC. don’t; will D. didn't; will
考题
在顺序结构表示的线性表中，删除第i个元素（数组下标为i-1)，需要把后面的所有元素都往前挪一位，相应的语句是： for （___________ ) PtrL-＞Data[j-1]=PtrL-＞Data[j]; 其中空缺部分的内容应该是A．j = i; j＜ = PtrL-＞Last; j++B．j =PtrL-＞Last; j＞= i; j--C．j = i-1; j＜ = PtrL-＞Last; j++D．j =PtrL-＞Last; j＞= i-1; j--
考题
12、以下算法的功能是在一个非递减的顺序存储线性表中，删除所有值相等的多余元素。时间复杂度为O（n)，空间复杂度为O（1)。划线部分应填入的语句是（）。 void DelRepeatData（SeqList *L) { i=0; j=1; while（j＜=L-＞last) { if（L-＞elem[i]==L-＞elem[j]) ; else { L-＞elem[i+1]=L-＞elem[j]; i++; j++; } } L-＞last=i; }A．i++B．j++C．i--D．j--
热门标签
最新试卷