List<map<String,String>>根据选择的key去重

根据传入的list<Map<String,String>>和指定的key去除重复的map。

public class Test {
public static void main(String[] args) {
List<Map<String, String>> list = new ArrayList<Map<String, String>>();
for (int i = 0; i < 5; i++) {
Map<String, String> map = new HashMap<String, String>();
map.put("cuprcd", "666666");
map.put("begndt", "20160921");
map.put("zhanghao", "" + i);
list.add(map);
}
for (int i = 0; i < 5; i++) {
Map<String, String> map = new HashMap<String, String>();
map.put("cuprcd", "55555");
map.put("begndt", "20160921");
map.put("zhanghao", "" + i);
list.add(map);
}


for (int i = 0; i < 5; i++) {
Map<String, String> map = new HashMap<String, String>();
map.put("cuprcd", "55555");
map.put("begndt", "20160922");
map.put("zhanghao", "" + i);
list.add(map);
}


for (int i = 0; i < 5; i++) {
Map<String, String> map = new HashMap<String, String>();
map.put("cuprcd", "33333");
map.put("begndt", "20160920");
map.put("zhanghao", "" + i);
list.add(map);
}
List<String> keys = new ArrayList<String>();
keys.add("cuprcd");
keys.add("begndt");
List<Map<String, String>> lists = getRemovalList(list, keys);
for (int i = 0; i < lists.size(); i++) {
System.out.println(lists.get(i).get("cuprcd"));
System.out.println(lists.get(i).get("begndt"));
System.out.println(lists.get(i).get("zhanghao"));
}
}


public static List<Map<String, String>> getRemovalList(
List<Map<String, String>> list, List<String> keys) {
List<Map<String, String>> lists = new ArrayList<Map<String, String>>();
try {
boolean flagOne = true;
boolean flagTwo = true;
boolean flagThree = true;
for (int i = 0; i < list.size(); i++) {
List<Boolean> flagsOne = new ArrayList<Boolean>();
List<Boolean> flagsTwo = new ArrayList<Boolean>();
for (int j = 0; j < lists.size(); j++) {
for (int j2 = 0; j2 < keys.size(); j2++) {
// 此处容易报错
flagTwo = lists.get(j).get(keys.get(j2))
.equals(list.get(i).get(keys.get(j2)));
if (!flagTwo) {
break;
}
}
flagsOne.add(flagTwo);
}
for (int k = 0; k < flagsOne.size(); k++) {
if (!flagsOne.get(k)) {
flagsTwo.add(flagsOne.get(k));
}
}
if (flagsOne.size() == flagsTwo.size()) {
flagThree = false;
}
if (!flagThree) {
flagOne = true;
flagThree = true;
}
if (flagOne) {
lists.add(list.get(i));
flagOne = false;
}
}
} catch (Exception e) {
e.printStackTrace();
}
return lists;
}


}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值