I worked _____12 last night. Of course, _____then I was really tired.A. till, afterB. at, tillC. till, by
I worked _____12 last night. Of course, _____then I was really tired.
A. till, after
B. at, till
C. till, by
相关考题：
-- I'm going on a trip to Hainan after the exam.-- Really?___________!A． Have a nice timeB． CongratulationsC． OKD． It' s nice of you
to, I, how, last, winter, skate, learned__________________________________________________________________________.
－I’m trying to call Marie, but there’s no answer.－(). A、Really? Maybe she’s outB、Here is a message for herC、I’m really sorry about itD、I didn’t realize that
--I'm going on a trip to Hainan after the exam.--Really? ______!A. Have a nice timeB. CongratulationsC. OKD. It's nice of you
— Nancy was badly injured in the accident yesterday and she was sent to hospital. — Oh, really? I（）. I（） visit her.Adidn’t know；will go toBdon’t know；will go toCdidn’t know；am going toDhaven’t known；am goingt o
2、在顺序结构表示的线性表中，删除第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--
在顺序结构表示的线性表中，删除第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--