网友您好， 请在下方输入框内输入要搜索的题目：
题目内容
（请给出正确答案）
I can’t put __ what he said.
A. on with
B. up for
C. up with
参考答案
更多 “ I can’t put __ what he said. A. on withB. up forC. up with ” 相关考题
考题
一What's happened to Tom?一________ to hospital.A. He's been takenB. He'll be takenC. He'll take
考题
He ______ to Shanghai for I saw him here a minute ago.
A. can’t goB. can’t have goneC. didn’t go
考题
YouwanttouseteCoherenceJavaAPIstodirectlycachedPOJOs.Considerthissnippetofcode：NamedCachecache-CacheFactory.getCache（mycache）；cache.put（newInteger（I）fhello）；cache.put（T，hi）；cache.put（newLong（II），hey）；Thiscodeinsertsthreeobjectsintothecache.Why？（）A.hashCode（）andequals（）methodforeachobjecttypeisdifferentsoadifferentkeyisusedB.eachobjectvaluestringisdifferentsoadifferentvalueisinsertedoneachputC.equals（）andcompare（）methodisdifferentforeachputD.POFneedtobeimplementedforthistoworkproperly
考题
下面的代码用于输出字符数组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); }
热门标签
最新试卷