HashSet:
1.
HashSet set = new HashSet(list);l
ist.clear();
list.addAll(set);
2.
List<String> reusltList = new ArrayList<String>(new TreeSet<String>(list));
List<String> reusltList1 = new ArrayList<String>(new LinkedHashSet<String>(list));
List的contains去重:
List<String> resultList = new ArrayList();
// 遍历list集合
for (int i = 0; i < list.size(); i++) {
// 判断resultList 集合中是否包含list中的元素
if (!resultList.contains(list.get(i))) {
// 将未包含的元素添加进resultList 集合中
resultList.add(list.get(i));
}
}
reomove去重:
if (null != list && list.size() > 0) {
//循环大的list集合
for (int i = 0; i < list.size(); i++) {
//得到list中每一个string
String str= list.get(i);
for (int j = 1; j < list.size(); j++) {
String str2= list.get(j);
if (str.equals(str2)) {
list.remove(j);
continue;
}
}
}
}
3.Java 8新特性去重:
List<String> resultList = list.stream().distinct().collect(Collectors.toList());