早教吧作业答案频道 -->其他-->
根据你自己朋友或家人的情况完成以下句子ifihadbeenifyouhadtoldmeiftheweatherhadchangedourteamwouldhavewon
题目详情
根据你自己朋友或家人的情况完成以下句子 if i had been if you had told me if the weather had changed
our team would have won
our team would have won
▼优质解答
答案和解析
（1） If I had been you ,I'd have finished the jod .
(2) If you had told me that ,I'd have gone abroad.
(3)If the weather had changed ,Tom would have gone fishing.
(2) If you had told me that ,I'd have gone abroad.
(3)If the weather had changed ,Tom would have gone fishing.
看了 根据你自己朋友或家人的情况完...的网友还看了以下：
对n个记录的文件进行堆排序,最坏情况下的执行时间为 A.O(log2n) B.O(n) C.O(nl 2020-05-23 …
对n个记录的文件进行堆排序,最坏情况下的执行时间为A.O(log2n)B.O(n)C.O(n log 2020-05-23 …
用堆排序方法,在最坏情况下的时间复杂度为()。A.O(n＋1)B.O(n2)C.O(log2n)D. 2020-05-23 …
在一个平面直角坐标系中,有一个矩形ABCD的顶点坐标分别为A(-a,b),B（-a,0）,C(a, 2020-06-03 …
已知∠AOB,在∠AOB外部作∠BOC,在∠AOC外作∠COD,且∠AOB：∠BOC：∠COD=1 2020-06-06 …
已知角aob,在角aob外作角boc,在角aoc外作角cod,且角aob：boc：角cod=1:2 2020-06-06 …
已知角aob在角aob外部作角boc,在角aoc外作角cod,且角aob；角boc；角cod=1； 2020-06-06 …
数据结构问题！冒泡排序！为什么不选C呢？.在对n个元素进行冒泡排序的过程中，最好情况下的时间复杂度 2020-07-23 …
数据结构的问题6．程序段For(i=n-1;i>0;i--)For(j=1;ja[j+1])a[j] 2020-10-30 …
程序段for(i=n-1;i>=0;i--)for(j=1;jA[j+1]A[j]与A[j+1]对换 2020-11-26 …