TreeMap 挑选出几千只股票中排序的前几只

public ArrayList<Stock> getNewsMostStocks() {
ArrayList<Stock> stocksList = new ArrayList<Stock>();
TreeMap<Double, String> treeMap = new TreeMap<Double, String>();
Connection conn;
try {
conn = ConnFactory.getConn();
for (Stock s : StockCodes.getCodes()) {
// System.out.println(s.getKey());
double res = NewsDao.checkStockNewsNum(conn, s);
// System.out.println("res1:" + res);
while (treeMap.containsKey((Double) res)) {
res += 0.0000000000001;
}
// System.out.println("res2:" + res);
treeMap.put(res, s.getKey());
// System.out.println();
}
conn.close();
} catch (Exception e) {
System.out.println(e);
}
int size = 0;
Iterator it = treeMap.entrySet().iterator();
while (it.hasNext()) {
size++;
if (treeMap.size() - size < limit) {
Map.Entry entry = (Map.Entry) it.next();
Object key = entry.getKey();
Object value = entry.getValue();
for (Stock sss : StockCodes.getCodes()) {
if (sss.getKey().equals(value)) {
stocksList.add(sss);
break;
}
}
} else {
it.next();
}
}
for (Stock sss : stocksList) {
System.out.println(sss.getKey());
}
return stocksList;
}