根据集合中数据不同的类型放到一块

public List<Map<String,Object>> rollList(List<Map<String,Object>> put){
           
        List<Map<String,Object>> maps = new  LinkedList<Map<String,Object>>();
        Map<Integer,List<Map<String,Object>>> RsMap = new TreeMap<Integer, List<Map<String,Object>>>();

        for(int i = 0;i<put.size();i++){
            if (!(RsMap.get(Integer.parseInt(put.get(i).get("flag").toString())) == null)){
                RsMap.get(Integer.parseInt(put.get(i).get("flag").toString())).add(put.get(i));
            }else{
                maps = new LinkedList<Map<String,Object>>();
                maps.add(put.get(i));
                RsMap.put(Integer.parseInt(put.get(i).get("flag").toString()),maps);
            }
        }
        int max = 0;
        //为了找到下面list分几组,max就是list最大长度,为下面遍历做准备
        for (Integer zs:RsMap.keySet()){
            if(max<RsMap.get(zs).size()){
                max = RsMap.get(zs).size();
            }
        }
        List<Map<String,Object>> outRs = null;
        List<List<Map<String,Object>>> Result=new LinkedList<List<Map<String,Object>>>();
        for (int i = 0;i<max;i++){
            outRs = new LinkedList<Map<String, Object>>();
            for (Integer zs:RsMap.keySet()){
                if (RsMap.get(zs).size()>0){
                    outRs.add(RsMap.get(zs).get(0));
                    RsMap.get(zs).remove(0);
                }
            }
            Result.add(outRs);
        }
        List<Map<String,Object>> list = new LinkedList<Map<String, Object>>();
        for (int i = 0;i<Result.size();i++){
            for (int y = 0;y<Result.get(i).size();y++){
                list.add(Result.get(i).get(y));
            }
        }
        return list;
	}

处理之前的数据:
[{amount=0.00, flag=4, nickName=惠心, create_time=2018-11-30 10:54:02.0, policy_money=0.18},
{amount=0.00, flag=4, nickName=刘格, create_time=2018-11-30 10:49:39.0, policy_money=0.18},
{amount=1.88, flag=1, nickName=北国, create_time=2018-11-30 10:34:34.0, policy_money=0},
{ amount=1.88, flag=1, nickName=White, create_time=2018-11-30 10:34:03.0, policy_money=0},
{amount=0.00, flag=3, nickName=子, create_time=2018-11-30 10:31:53.0, policy_money=洛},
{amount=0.00, flag=2, nickName=郝, create_time=2018-11-30 10:22:35.0, policy_money=5.80},
{amount=0.00, flag=2, nickName=天格, create_time=2018-11-30 10:13:36.0, policy_money=5.80}]
处理完之后的数据:
[ {amount=1.88, flag=1, nickName=北国, create_time=2018-11-30 10:34:34.0, policy_money=0},
{amount=0.00, flag=2, nickName=郝, create_time=2018-11-30 10:22:35.0, policy_money=5.80},
{amount=0.00, flag=3, nickName=子, create_time=2018-11-30 10:31:53.0, policy_money=洛},
{amount=0.00, flag=4, nickName=刘格, create_time=2018-11-30 10:49:39.0, policy_money=0.18},
{ amount=1.88, flag=1, nickName=W, create_time=2018-11-30 10:34:03.0, policy_money=0},
{amount=0.00, flag=2, nickName=天格, create_time=2018-11-30 10:13:36.0, policy_money=5.80},
{amount=0.00, flag=4, nickName=惠心, create_time=2018-11-30 10:54:02.0, policy_money=0.18},
]

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值