网友您好， 请在下方输入框内输入要搜索的题目：
题目内容
（请给出正确答案）
Thank you. I’ll ask Mr. Heine _____ as soon as I can get hold of him.
参考答案
更多 “ Thank you. I’ll ask Mr. Heine _____ as soon as I can get hold of him. ” 相关考题
考题
Lodger: I’m terribly sorry that I broke you precious vase. I’ll pay for it.Landlady:____.
A.Can’t complainB.Take careC.Relax yourselfD.Never mind
考题
— Jane, I’m coming to say good-bye. I’m leaving tomorrow.\n— _______A.I’m sorry.B.Oh, no. Why?C.Go slowly.D.Why soon? Can’t you stay a few days longer?
考题
–– Jack: Mommy, when will we have dinner? I'm starving.–– Mother:————————? We have to wait for daddy.A: Quickly, honeyB: OK, honeyC: Soon, honeyD: All right, honey
考题
下列程序执行后的输出结果是( )。 void func1 (int i)； void func2(int i)； char st[]="hello,friend!"； void func1 (int i) { printf("%c"，st[i])； if(i＜3){i+=2；func2(i)；} } void func2(int i) { printf("%c"，st[i])； if(i＜3){i+=2；func1(i);}A．helloB．helC．holD．hlm
考题
I′m sorry I can′t see you immediately;but if you′d like to take a seat,I′ll?be with?you__________.A.for a moment
B.in a moment
C.for the moment
D.at the moment
考题
下面的代码用于输出字符数组ch中每个字符出现的次数，应该填入的代码是（）public static void main（String[] args) { char[] ch = { 'a', 'c', 'a', 'b', 'c', 'b' }; HashMap map = new HashMap（); for （int i = 0; i ＜ ch.length; i++) { ＜ 填入代码 ＞ } System.out.println（map); }A．if (map.contains(ch[i])) { map.put(ch[i], map.get(ch[i]) + 1); } else { map.put(ch[i], 1); }B．if (map.contains(ch[i])) { map.put(ch[i], (Integer) map.get(ch[i]) + 1); } else { map.put(ch[i], 1); }C．if (map.containsKey(ch[i])) { map.put(ch[i], (int) map.get(ch[i]) + 1); } else { map.put(ch[i], 1); }D．if (map.containsKey(ch[i])) { map.put(ch[i], (Integer) map.get(ch[i]) + 1); } else { map.put(ch[i], 1); }
热门标签
最新试卷