阿里字节技术大佬都在用的List集合去重方案！

// 遍历后判断赋给另一个List集合，保持原来顺序
public static void ridRepeat1(List<String> list) {
    System.out.println("list = [" + list + "]");
    List<String> listNew = new ArrayList<String>();
    for (String str : list) {
        if (!listNew.contains(str)) {
            listNew.add(str);
        }
    }
    System.out.println("listNew = [" + listNew + "]");
}

// Set集合去重，保持原来顺序
public static void ridRepeat2(List<String> list) {
    System.out.println("list = [" + list + "]");
    List<String> listNew = new ArrayList<String>();
    Set set = new HashSet();
    for (String str : list) {
        if (set.add(str)) {
            listNew.add(str);
        }
    }
    System.out.println("listNew = [" + listNew + "]");
}

// Set去重     由于Set(HashSet)的无序性，不会保持原来顺序
public static void ridRepeat3(List<String> list) {
    System.out.println("list = [" + list + "]");
    Set set = new HashSet();
    List<String> listNew = new ArrayList<String>();
    set.addAll(list);
    listNew.addAll(set);
    System.out.println("listNew = [" + listNew + "]");
}

// Set通过HashSet去重（将ridRepeat3方法缩减为一行） 无序
public static void ridRepeat4(List<String> list) {
    System.out.println("list = [" + list + "]");
    List<String> listNew = new ArrayList<String>(new HashSet(list));
    System.out.println("listNew = [" + listNew + "]");
}

// Set通过TreeSet去重   会按字典顺序重排序
public static void ridRepeat5(List<String> list) {
    System.out.println("list = [" + list + "]");
    List<String> listNew = new ArrayList<String>(new TreeSet<String>(list));
    System.out.println("listNew = [" + listNew + "]");
}

// Set通过LinkedHashSet去重  保持原来顺序
public static void ridRepeat6(List<String> list) {
    System.out.println("list = [" + list + "]");
    List<String> listNew = new ArrayList<String>(new LinkedHashSet<String>(list));
    System.out.println("listNew = [" + listNew + "]");
}

List uniqueList = list.stream().distinct().collect(Collectors.toList());
System.out.println(uniqueList.toString());

List<User> userList = new ArrayList<>();
userList.add(new User(name: "小黄", age: 10));
userList.add(new User(name: "小红", age: 23));
userList.add(new User(name: "小黄", age: 78));
userList.add(new User(name: "小黄", age: 10));

// 使用HashSet,无序
Set<User> userSet = new HashSet<>(userList);
System.out.println(userSet);

// 使用LinkedHashSet,有序
List<User> listNew = new ArrayList<>(new LinkedHashSet<>(userList));
System.out.println(listNew.toString());

[User(name=小黄, age=78), User(name=小黄, age=10), User(name=小红, age=23)]
[User(name=小黄, age=10), User(name=小红, age=23), User(name=小黄, age=78)]

// name属性去重
List<User> uniqueNameList = userList
        .stream()
        .collect(collectingAndThen(
                toCollection(() -> new TreeSet<>(comparing(User::getName))), ArrayList::new)
        );

System.out.println("根据name去重后集合元素：" + uniqueNameList.toString());

// name,age属性去重
List<User> uniqueNameAndAgeList = userList
        .stream()
        .collect(collectingAndThen(
                toCollection(() -> new TreeSet<>(comparing(o -> o.getName() + ";" + o.getAge()))), ArrayList::new)
        );

System.out.println("根据name,age去重后集合元素：" + uniqueNameAndAgeList.toString());

源集合元素：[User(name=张三, age=78), User(name=李四, age=23), User(name=张三, age=10)]
有序集合元素：[User(name=张三, age=10), User(name=李四, age=23), User(name=张三, age=78)]
根据name去重后集合元素：[User(name=张三, age=10), User(name=李四, age=23)]
根据name,age去重后集合元素：[User(name=张三, age=10), User(name=张三, age=78), User(name=李四, age=23)]

@Override
public boolean equals(Object obj) {
    User user = (User) obj;
    return name.equals(user.getName()) && (age==user.getAge());
}

@Override
public int hashCode() {
    String str = name + age;
    return str.hashCode();
}