统计各type的消息的总数

/** 
* 统计各type的消息的总数
* @return Map:[type:int, count:int, message:List<MessageDetail>]
*/
private List<Map<String, Object>> count(List<MessageDetail> list) {
List<Map<String, Object>> returnlist = new ArrayList<Map<String,Object>>();
//
int count = 0;
int lastType = -1;
int lastPosition = 0;
//
List<MessageDetail> messages = null ;
Map<String, Object> map = null;
List<Integer> removePositions = null;
//
for (int i = 0; i < list.size(); ) {
if(lastType!= list.get(i).getType()){
count = 0;
lastType = list.get(i).getType();
lastPosition = i;
messages = new ArrayList<MessageDataInfo.MessageDetail>();
removePositions = new ArrayList<Integer>();
map = new HashMap<String, Object>();
map.put("type", lastType);
}
for (int j = lastPosition; j < list.size(); j++) {
if(list.get(j).getType() == lastType){
count++;
map.put("count", count);
messages.add(list.get(j));
//list.remove(j);
removePositions.add(j);
map.put("messages", messages);
}
}
//一定要从后往前删
for(int k = removePositions.size()-1; k >= 0; k--){
int position = removePositions.get(k);
list.remove(position);
}
returnlist.add(map);
//map.clear();
}


return returnlist;
}/** 
* 统计各type的消息的总数
* @return Map:[type:int, count:int, message:List<MessageDetail>]
*/
private List<Map<String, Object>> count(List<MessageDetail> list) {
List<Map<String, Object>> returnlist = new ArrayList<Map<String,Object>>();
//
int count = 0;
int lastType = -1;
int lastPosition = 0;
//
List<MessageDetail> messages = null ;
Map<String, Object> map = null;
List<Integer> removePositions = null;
//
for (int i = 0; i < list.size(); ) {
if(lastType!= list.get(i).getType()){
count = 0;
lastType = list.get(i).getType();
lastPosition = i;
messages = new ArrayList<MessageDataInfo.MessageDetail>();
removePositions = new ArrayList<Integer>();
map = new HashMap<String, Object>();
map.put("type", lastType);
}
for (int j = lastPosition; j < list.size(); j++) {
if(list.get(j).getType() == lastType){
count++;
map.put("count", count);
messages.add(list.get(j));
//list.remove(j);
removePositions.add(j);
map.put("messages", messages);
}
}
//一定要从后往前删
for(int k = removePositions.size()-1; k >= 0; k--){
int position = removePositions.get(k);
list.remove(position);
}
returnlist.add(map);
//map.clear();
}


return returnlist;
}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值