A: May I put my books here? B: Yes, put them please.() 此题为判断题(对，错)。
A: May I put my books here? B: Yes, put them please.()
此题为判断题(对，错)。
相关考题：
You can stay here tonight.We can ( )you ______in the spare room. A.put...upB.put...awayC.put...downD.put...off
Mrs.Browers told her children to ( )their toys __________and go to bed. A.put...awayB.put...upC.put...downD.put...on
You needn't go back to London tonight.We can( )you______for the night. A.put...awayB.put ...upC.put...offD.put...down
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
有以下程序: include include using namespace std; int main () {char ch[] 有以下程序：include ＜fstream＞include ＜string＞using namespace std;int main (){char ch[] = "The end";ofstream outstr( "d:\\put.txt", ios_base: :app);for (int i = 0; i ＜ strlen( ch ); i++ )outstr.put(ch[i]);outstr.close();return 0;}程序实现的功能是【 】。
下面程序的输出结果是()。includeusing namespace std;void main(){char cl='a',c2='c 下面程序的输出结果是( )。 #include＜iostream＞ using namespace std; void main() { char cl='a',c2='c'; cout.put('a').put('c').put('\n'); cout.put(c1).put(c2); }A．ac a cB．ac acC．a c ac cD．a c
下面的代码用于输出字符数组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); }