早教吧作业答案频道 -->英语-->
DidyoukonwAwhohewaslookingafterBwhowashelookingforCwhoheislookingforDwhoheislookingafter这个我选的是C,可是是错的,正确答案没问老师.lookafter和lookfor有什么区别,我知道意思不同,但用法不清楚.
题目详情
Did you konw
Awho he was looking after Bwho was he looking for
Cwho he is looking for Dwho he is looking after
这个我选的是C,可是是错的,正确答案没问老师.look after 和 look for有什么区别,我知道意思不同,但用法不清楚.
2It was very yesterday,but it is today.
Aeven hotter Bmore hotter Cmuch more hot Dmuch hot
这个我选的是A,同样也错.
3He didn't know her address,did I.
Atoo Balso Ceither Dneither
这个更不懂,只学过so am I ,so did I之类的.正确应该选哪个?why?
Awho he was looking after Bwho was he looking for
Cwho he is looking for Dwho he is looking after
这个我选的是C,可是是错的,正确答案没问老师.look after 和 look for有什么区别,我知道意思不同,但用法不清楚.
2It was very yesterday,but it is today.
Aeven hotter Bmore hotter Cmuch more hot Dmuch hot
这个我选的是A,同样也错.
3He didn't know her address,did I.
Atoo Balso Ceither Dneither
这个更不懂,只学过so am I ,so did I之类的.正确应该选哪个?why?
▼优质解答
答案和解析
第一题选A,宾语从句要用陈述语序,且时态受主句影响,因为主句是过去时,所以从句也用与过去时相关的时态.look after：照顾 look for：寻找第二题应该是It was very hot yesterday,but it is------ today.你打漏了一...
看了 DidyoukonwAwho...的网友还看了以下：
设平衡二叉排序树(AVL树)的节点个数为n,则其平均检索长度为A.O(1)B.O(log2n)C.O 2020-05-23 …
在二维数组M[0...n,0...m]中,访问某个元素的平均时间复杂度为______。A.O(1)B 2020-05-23 …
设平衡的二叉排序树(AVL树)的结点个数为n,则其平均检索长度为A.O(1)B.O(log2n)C. 2020-05-24 …
设平衡的二叉排序树(AVL树)的结点个数为n,则其平均检索长度为()。A.O(1)B.O(log2n 2020-05-24 …
A.O(1),O(1)B.O(n),O(1)C.O(n2),O(1)D.O(n),O(n) 2020-05-26 …
A.O(n2)B.O(n)C.O(n－1)D.O(n＋1) 2020-05-26 …
A.O(n2)B.O(nlogn)C.O(d,n＋d,rd)D.O(n) 2020-05-26 …
数据结构问题！冒泡排序！为什么不选C呢？.在对n个元素进行冒泡排序的过程中，最好情况下的时间复杂度 2020-07-23 …
设算法的计算时间可用递推关系式T(n)=2T(n/2)+n表示,则该算法的时间复杂度为（）A:O（ 2020-08-01 …
3.下面算法的时间复杂度为？3.下面算法的时间复杂度为。intf(unsignedintn){if( 2021-01-14 …