/**
* @Description: 统计每个小时的top情况,返回当前小时List中的前三名
* @From: buildPersonalSimpleStaticsList
* @Parameters: :
* @Author:lijiandong, jiandong.li@renren-inc.com
* @Version: 1.0 2013-4-15下午05:13:24
*/
private List<PersonalSimpleStatistics> statTop(List<PersonalSimpleStatistics> personList) {
PersonalSimpleStatistics person;
PersonalSimpleStatistics top;
List<PersonalSimpleStatistics> topList = new ArrayList<PersonalSimpleStatistics>();
for(int i = 0; i < 10; i++){
topList.add(i, new PersonalSimpleStatistics());
}
float topCount;
for (int i = 0, len = personList.size(); i < len; i++) {
person = personList.get(i);
// 总数据=初审*0.2 + 过初审一审*0.8 + 不过初审一审 + 二审*0.33
topCount = person.getPreVerifyCount() * 0.2f + person.getAfterPreOnceVerifyCount() * 0.8f
+ person.getOnceVerifyCount() + person.getTwiceVerifyCount() * 0.33f;
person.setTopCount(topCount);
for (int j = 0, jlen = topList.size(); j < jlen; j++) {
top = topList.get(j);
if (person.getTopCount() > top.getTopCount()) {
if (j == 0) {
topList.set(j + 2, topList.get(j + 1));
topList.set(j + 1, topList.get(j + 0));
topList.set(j, person);
}
else if (j == 1) {
topList.set(j + 1, topList.get(j + 0));
topList.set(j, person);
}
else if (j == 2) {
topList.set(j, person);
}
break;
}
}
}
return topList;
}
效率不高的前三占坑法
最新推荐文章于 2022-07-06 14:36:22 发布