java中Map的去重合并

import java.util.HashMap;

import java.util.IdentityHashMap;
import java.util.Iterator;
import java.util.Map;
import java.util.Map.Entry;
import java.util.TreeMap;

public class MapTest {

public static void main(String[] args) {

Map<Object, TreeMap<String, Object>> tree = new IdentityHashMap<>();
TreeMap<String, Object> test0 = new TreeMap<>();
test0.put("11:01", 111);
test0.put("11:02", 222);

TreeMap<String, Object> test1 = new TreeMap<>();
test1.put("11:03", 333);
test1.put("11;04", 444);

String str1 = new String("1");
String str2 = new String("1");

String str3 = new String("2");
String str4 = new String("2");

tree.put(str1, test0);
tree.put(str2, test1);

tree.put(str3, test0);
tree.put(str4, test1);

System.out.println(tree);

Map<Object, TreeMap<String, Object>> map000 = mapK(tree);

System.out.println(map000);

}

@SuppressWarnings("rawtypes")
public static Map<Object, TreeMap<String, Object>> mapK(Map<Object, TreeMap<String, Object>> map) {

Map<Object, TreeMap<String, Object>> tree = new HashMap<>();
for (Entry<Object, TreeMap<String, Object>> vo : map.entrySet()) {
Object key1 = vo.getKey();
if (!tree.containsKey(key1)) {
tree.put(key1, vo.getValue());
} else {
TreeMap<String, Object> map1 = vo.getValue();
Iterator<?> iter = map1.entrySet().iterator();
while (iter.hasNext()) {
Map.Entry entry = (Map.Entry) iter.next();
String key = (String) entry.getKey();
Object integ = (Integer) entry.getValue();
tree.get(key1).put(key, integ);
}
}
}
return tree;
}

  1. }

转载于:https://www.cnblogs.com/dengzhao/p/7832284.html

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值