List<Map<String, String>> 合并map的字段数据问题

背景

最近遇到一个问题,List<Map<String,String>>首先要根据 Map的seq字段去重,然后如果一个map的nseq等于另一个map的seq,那么这两个map的data字段数据需要合并,依次类推。程序运行的结果如下:
[{nseq=000, data=map1, seq=1}, {nseq=222, data=map2map4map3, seq=2}, {nseq=null, data=map5map7, seq=3}]

具体实现

public class AlgorithmTest {


    public static void main(String[] args) {
        List<Map<String, String>> values = new ArrayList<Map<String, String>>();

        Map<String, String> map1 = new HashMap<String, String>();
        map1.put("seq", "1");
        map1.put("nseq", "000");
        map1.put("data", "map1");
        values.add(map1);

        Map<String, String> map2 = new HashMap<String, String>();
        map2.put("seq", "2");
        map2.put("nseq", "001");
        map2.put("data", "map2");
        values.add(map2);

        Map<String, String> map3 = new HashMap<String, String>();
        map3.put("seq", "011");
        map3.put("nseq", "222");
        map3.put("data", "map3");
        values.add(map3);

        Map<String, String> map4 = new HashMap<String, String>();
        map4.put("seq", "001");
        map4.put("nseq", "011");
        map4.put("data", "map4");
        values.add(map4);

        Map<String, String> map5 = new HashMap<String, String>();
        map5.put("seq", "3");
        map5.put("nseq", "333");
        map5.put("data", "map5");
        values.add(map5);

        Map<String, String> map6 = new HashMap<String, String>();
        map6.put("seq", "1");
        map6.put("nseq", "000");
        map6.put("data", "map1");
        values.add(map6);

        Map<String, String> map7 = new HashMap<String, String>();
        map7.put("seq", "333");
        map7.put("nseq", null);
        map7.put("data", "map7");
        values.add(map7);

        Map<String, Map<String, String>> utPacket = filterRepeat(values);
        List<Map<String, String>> v = payloadCombiner(utPacket);

        System.out.println(v.toString());
    }


    public static List<Map<String, String>> payloadCombiner(Map<String, Map<String, String>> utPacket) {

        List<String> tmp = Lists.newArrayList();
        for (Map.Entry<String, Map<String, String>> entry : utPacket.entrySet()) {

            Map<String, String> v = entry.getValue();
            String current = v.get("nseq");
            if (utPacket.containsKey(current)) {
                Map<String, String> v1 = utPacket.get(current);
                String value1 = v.get("data").toString();
                String value2 = v1.get("data").toString();
                v.put("data", value1.concat(value2));
                v.put("nseq", v1.get("nseq"));
                tmp.add(v1.get("seq"));
            }
        }
        if (tmp.size() != 0) {
            for (String str : tmp) {
                utPacket.remove(str);
            }
            payloadCombiner(utPacket);
        }
        List<Map<String, String>> last = new ArrayList<Map<String, String>>();
        for (Map<String, String> value : utPacket.values()) {
            last.add(value);
        }
        return last;
    }

    /**
     * Filter repeat.
     */
    public static Map<String, Map<String, String>> filterRepeat(List<Map<String, String>> values) {

        Map<String, Map<String, String>> utPacket = Maps.newHashMap();

        for (Map<String, String> value : values) {
            Map<String, String> udpAndTcpPacket = value;
            String seq = udpAndTcpPacket.get("seq");
            utPacket.put(seq, udpAndTcpPacket);
        }
        return utPacket;
    }


}

说明

大家如果有更好方法,请在下面留言并给出解决方法。

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值