When________ that it was getting late, I put off the light and went to bed.A、findB、findingC、foundD、to find
When________ that it was getting late, I put off the light and went to bed.
A、find
B、finding
C、found
D、to find
相关考题：
While I_____ to the supermarket by bus, I_____ an old friend.A. was going, metB. went, met .C. was going, was meeting.
A: Hi! Jack, Where were you these days?B: I_____ to Japan last month and came back only yesterday.A. goB. beenC. went
You can stay here tonight.We can ( )you ______in the spare room. A.put...upB.put...awayC.put...downD.put...off
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
用动态规划方法求解0/1背包问题时，将“用前i个物品来装容量是X的背包”的0/1背包问题记为 KNAP(1,i,X)，设fi(X)是KNAP(1,i,X)最优解的效益值，第j个物品的重量和放入背包后取得效益值分别为Wj和巧Pj(j=1～n)。则依次求解f0(X)、f1(X)、…、fn(X)的过程中使用的递推关系式为(58)。A．fi(X)=min{fi-1(X),fi-1(X)+pi}B．fi(X)=min{fi-1(X),fi-1(X-wi)+pi}C．fi(X)=max{fi-1(X),fi-1(X-wi)+pi}D．fi(X)=max{fi-1(X-wi),fi-1(X)+pi}
有以下程序: 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;}程序实现的功能是【 】。
下面的代码用于输出字符数组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); }
要素si（i=1,2,…,n）的影响度fi和被影响度ei， 则其中心度与原因度为：A．fi-ei fi+eiB．ei - fi fi+eiC．fi+ei ei - fiD．fi+ei fi-ei