1.基礎(chǔ)數(shù)據(jù)類型集合去重：

例：String

    public static void main(String[] args) {
        List<String> list = new ArrayList<>();
        list.add("c");
        list.add("c");
        list.add("a");
        list.add("a");
        list.add("b");
        //1.set集合去重，不改變原有的順序
        pastLeep1(list);
        //2.遍歷后判斷賦給另一個(gè)list集合  不改變原有的順序
        pastLeep2(list);
        //3.set去重  并按自然順序排序
        pastLeep3(list);
        //4.set去重（縮減為一行）
        pastLeep4(list);
        //5.去重并按自然順序排序
        pastLeep5(list);
    }

方法實(shí)現(xiàn)：

 //1.set集合去重，不改變原有的順序
    public static void pastLeep1(List<String> list){
        System.out.println("list = [" + list.toString() + "]");
        List<String> listNew=new ArrayList<>();
        Set set=new HashSet();
        for (String str:list) {
            if(set.add(str)){
                listNew.add(str);
            }
        }
        System.out.println("listNew = [" + listNew.toString() + "]");
    }
    //2.遍歷后判斷賦給另一個(gè)list集合 不改變原有的順序
    public static void pastLeep2(List<String> list){
        System.out.println("list = [" + list.toString() + "]");
        List<String> listNew=new ArrayList<>();
        for (String str:list) {
            if(!listNew.contains(str)){
                listNew.add(str);
            }
        }
        System.out.println("listNew = [" + listNew.toString() + "]");
    }
    //3.set去重  并按自然順序排序
    public static void pastLeep3(List<String> list){
        System.out.println("list = [" + list + "]");
        Set set = new HashSet();
        List<String> listNew=new ArrayList<>();
        set.addAll(list);
        listNew.addAll(set);
        System.out.println("listNew = [" + listNew + "]");
    }
    //4.set去重（縮減為一行） 并按自然順序排序
    public static void pastLeep4(List<String> list){
        System.out.println("list = [" + list + "]");
        List<String> listNew=new ArrayList<>(new HashSet(list));
        System.out.println("listNew = [" + listNew + "]");
    }
    //5.去重并按自然順序排序
    public static void pastLeep5(List<String> list){
        System.out.println("list = [" + list + "]");
        List<String> listNew=new ArrayList<>(new TreeSet<String>(list));
        System.out.println("listNew = [" + listNew + "]");
    }

2.對象根據(jù)指定屬性去重

 List<User>userList = new ArrayList<>();
        userList.add(new User(1,"小李","男"));
        userList.add(new User(5,"小李","男"));
        userList.add(new User(7,"小李","男"));
        userList.add(new User(3,"小李","男"));
        userList.add(new User(1,"小李","男"));
        userList.add(new User(5,"小李","男"));
        //6.對象 根據(jù)指定屬性去重 并按自然順序排序
        System.out.println(removeDuplicateUser(userList));
        //7. 根據(jù)指定屬性去重 并按自然順序排序2
        System.out.println(removeDuplicateUser2(userList));

   //6.對象 根據(jù)指定屬性去重 并按自然順序排序
    public static ArrayList<User> removeDuplicateUser(List<User> users) {
        Set<User> set = new TreeSet<User>(new Comparator<User>() {
            @Override
            public int compare(User o1, User o2) {
                return new Integer(o1.getId()).compareTo(new Integer(o2.getId()));
            }
        });
        set.addAll(users);
        return new ArrayList<User>(set);
    }
    //7. 根據(jù)指定屬性去重 并按自然順序排序2
    public static List<User> removeDuplicateUser2(List<User> list){
        List<User> unique = list.stream().collect(
                collectingAndThen(
                        toCollection(() -> new TreeSet<>(comparingLong(User::getId))), ArrayList::new)
        );
        return unique;
    }

以上就是動(dòng)力節(jié)點(diǎn)小編介紹的"Java集合去重的幾種方法"，希望對大家有幫助，如有疑問，請?jiān)诰€咨詢，有專業(yè)老師隨時(shí)為您服務(wù)。