省流助手:
// 1.Stream去重 最好使!
list = list.stream().distinct().collect(Collectors.toList());
package com.zhouquan.controller;
import java.util.*;
import java.util.stream.Collectors;
/**
* @author zhouquan
* @description 列表操作测试
* @date 2022-07-29 10:27
**/
public class ListOperation {
public static void main(String[] args) {
Integer[] array = new Integer[]{7, 7, 7, 4, 4, 1, 8, 5, 2, 9, 6, 3, 0,0,0};
// 用于去重的列表
List<Integer> list = Arrays.stream(array).collect(Collectors.toList());
System.out.println("原集合:" + list);
// 1.Stream去重 会自动排序
list = list.stream().distinct().collect(Collectors.toList());
System.out.println("list去重:" + list);
// 2.遍历去重
List<Integer> newList = new ArrayList<>(list.size());
list.forEach(i -> {
if (!newList.contains(i)) {
// 如果新集合中不存在则插入
newList.add(i);
}
});
System.out.println("遍历去重:" + newList);
// 3.HashSet去重 会自动排序
list = Arrays.stream(array).collect(Collectors.toList());
HashSet<Integer> set = new HashSet<>(list);
System.out.println("HashSet去重:" + set);
// 4.TreeSet去重 会自动排序
list = Arrays.stream(array).collect(Collectors.toList());
TreeSet<Integer> treeSet = new TreeSet<>(list);
System.out.println("TreeSet去重:" + treeSet);
// 5.LinkedHashSet去重,既能去重又能保证集合的顺序
list = Arrays.stream(array).collect(Collectors.toList());
LinkedHashSet<Integer> linkedHashSet = new LinkedHashSet<>(list);
System.out.println("linkedHashSet去重:" + linkedHashSet);
}
}
执行结果:
原集合:[7, 7, 7, 4, 4, 1, 8, 5, 2, 9, 6, 3, 0, 0, 0]
list去重:[7, 4, 1, 8, 5, 2, 9, 6, 3, 0]
遍历去重:[7, 4, 1, 8, 5, 2, 9, 6, 3, 0]
HashSet去重:[0, 1, 2, 3, 4, 5, 6, 7, 8, 9]
TreeSet去重:[0, 1, 2, 3, 4, 5, 6, 7, 8, 9]
linkedHashSet去重:[7, 4, 1, 8, 5, 2, 9, 6, 3, 0]