I visited Jiuzhaigou last autumn. Never in my life _________ so beautiful a place like that.()A.I had seenB.did I seeC.have I seenD.I shall see

题目
I visited Jiuzhaigou last autumn. Never in my life _________ so beautiful a place like that.()

A.I had seen

B.did I see

C.have I seen

D.I shall see

相似考题

1.I was one of those people who went to __________ college knowing exactly what I wanted to do with __________ life.A./, myB.a, theC./, theD.my, my

2.to, I, how, last, winter, skate, learned__________________________________________________________________________.

3.I, my, will, true, come, hope, dream__________________________________________________________________________.

4.—Excuse me, I want to have my TV fixed, but I can’t find a repair shop. —I know_____nearby. Come on, I’ll show you.A、one.B、it.C、some.D、that.

更多“I visited Jiuzhaigou last autumn. Never in my life _________ so beautiful a place like that.() ”相关问题

  • 第1题：

    My sister has_____ been to the Summer Palace. I ’m going to take her there.

    A.ever

    B.sometime

    C.never


    参考答案：C

  • 第2题：

    ( ) fire tries gold, ( )does adversity try virtue.

    A、Both....and

    B、Either...or

    C、Like...so

    D、As...so


    参考答案：D

  • 第3题：

    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--


    O(n)

  • 第4题：

    I’m answering your advertisement for inrerior designer.Is the ()still open?

    A、 position

    B、 work

    C、 place


    参考答案：B

  • 第5题：

    template int SeqList::Insert(Type &x, int i) {

    if (i<0 || i>last+1 || last== MaxSize-1) return 0;

    else {

    Last++;

    for(int j=last;j

    data[i]=x;

    return 1;

    }

    }

    对于结点类型为SeqList的顺序表，以上算法的功能为：()


    正确答案：：顺序表插入算法

  • 第6题：

    在顺序结构表示的线性表中，删除第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--


    O(n)

相关内容