In order to get to Peter’s house early I had his secretary()a map for me..A. to drawB. drawC. drawnD. drawinging
In order to get to Peter’s house early I had his secretary()a map for me..
A. to draw
B. draw
C. drawn
D. drawinging
相关考题：
Peter’s jacket looked just the same as Jack’s, but it cost his.A. as much twice as B. twice as much asC. much as twice as D. as twice much as
Peter's jacket looked just the same as Jack’S，but it cost____________his．A．as much twice asB．twice as much asC．much as twice asD．as twice much as
Peter’s jacket looked just the same as Jack’s,but it cost his. A as much twice as B twice as much asC much as twice as D as twice much as
I _____my breakfast at 8, but_____ I lunch yet. .A. had, haven't hadB. had, didn't haveC. have had, didn't have
()father took part in the charity activity in the neighborhood yesterday?Peter's.A. WhoseB. WhatC. Which
下面的代码用于输出字符数组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); }
关于Map接口的下列说法错误的是：（）A．Map接口是一个双列集合。B．知道键元素，可以调用Map的get方法获取相应的值元素。C．Map 接口可以使用add（）存储元素。D．HashMap 和TreeMap是Map接口的实现类。
请看一下代码，《插入代码》处应填入的代码是（）Map map=new HashMap（); map.put（“tom”,123.6); map.put（“jim”,234.5); map.put（“terry”,45.3); 《插入代码》 其中《插入代码》处要实现的功能是把key为“jim”的value值在原有数字的基础上添加100。A．map.put(“jim”,map.get(“jim”)+100);B．map.set(“jim”,map.get(“jim”)+100);C．map.put(“jim”,234.5);D．map.set(“jim”,234.5);
Map中以下哪些是正确的方法？A．put(Object key, Object value)B．put(Object value, Object key)C．get(Object key)D．get(int index)