package com.yanshu.dao;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.List;
import java.util.Map;
import java.util.Queue;
* 去除重复元素
*
* @param queueAll 需要处理的list
* @param <T> 泛型方法
* @return 去重后的list
*/
public static <T> List<T> removeDuplicate(Queue queueAll) {
if (queueAll == null || queueAll.size() == 0) {
return new ArrayList<>();
}
return new ArrayList<>(new HashSet<>(queueAll));
}
public static void main(String[] args) {
/* List list=new ArrayList();*/
/*list.add(1);
list.add(1);
list.add(1);
list.add(2);
list.add(3);*/
/* Map map=new HashMap();
map.put("1", 20);
map.put("1", 20);
map.put("3", 20);
list.add(map);
removeDuplicate(list);
System.out.println( removeDuplicate(list));*/
Queue queueAll = new LinkedList<>();
queueAll.offer(1);
queueAll.offer(1);
queueAll.offer(1);
System.out.println( removeDuplicate(queueAll));
}
}
import java.util.ArrayList;
import java.util.HashMap;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.List;
import java.util.Map;
import java.util.Queue;
public class TestArray {
/**
* 去除重复元素
*
* @param list 需要处理的list
* @param <T> 泛型方法
* @return 去重后的list
*/
public static <T> List<T> removeDuplicate(List<T> list) {
if (list == null || list.size() == 0) {
logger.error("list is empty or is null");
return new ArrayList<>();
}
return new ArrayList<>(new HashSet<>(list));
}
* 去除重复元素
*
* @param queueAll 需要处理的list
* @param <T> 泛型方法
* @return 去重后的list
*/
public static <T> List<T> removeDuplicate(Queue queueAll) {
if (queueAll == null || queueAll.size() == 0) {
return new ArrayList<>();
}
return new ArrayList<>(new HashSet<>(queueAll));
}
public static void main(String[] args) {
/* List list=new ArrayList();*/
/*list.add(1);
list.add(1);
list.add(1);
list.add(2);
list.add(3);*/
/* Map map=new HashMap();
map.put("1", 20);
map.put("1", 20);
map.put("3", 20);
list.add(map);
removeDuplicate(list);
System.out.println( removeDuplicate(list));*/
Queue queueAll = new LinkedList<>();
queueAll.offer(1);
queueAll.offer(1);
queueAll.offer(1);
System.out.println( removeDuplicate(queueAll));
}
}