• List的五种去重方式


    一、String去重:
    //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() + "]");
        }
    
        //遍历后判断赋给另一个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() + "]");
        }
    
        //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 + "]");
        }
    
        //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 + "]");
        }
    
        //去重并按自然顺序排序
        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 + "]");
        }

      

    二、对象去重方法:


    package com.hcycom.iams.ncolog;
    
    import java.util.*;
    import static java.util.Comparator.comparingLong;
    import static java.util.stream.Collectors.collectingAndThen;
    import static java.util.stream.Collectors.toCollection;
    
    public class Test {
    
        public static void main(String[] args) {
            Data data1 = new Data(1,"aaaa");
            Data data2 = new Data(2,"dddd");
            Data data3 = new Data(1,"vvvv");
            Data data4 = new Data(4,"rrrr");
            Data data5 = new Data(1,"ssss");
            List<Data> list = Arrays.asList(data1,data2,data3,data4,data5);
            List<Data> l = test2(list);
            System.out.println(Arrays.toString(l.toArray()));
    
        }
    
        //对象去重
        public static List<Data> test2(List<Data> list){
            List<Data> unique = list.stream().collect(
                    collectingAndThen(
                            toCollection(() -> new TreeSet<>(comparingLong(Data::getId))), ArrayList::new)
            );
            return unique;
        }
    }
    
    // 实体对象
    class Data{
    
        private int id;
        private String name;
    
        public Data(int id, String name) {
            this.id = id;
            this.name = name;
        }
    
        public int getId() {
            return id;
        }
    
        public void setId(int id) {
            this.id = id;
        }
    
        public String getName() {
            return name;
        }
    
        public void setName(String name) {
            this.name = name;
        }
    
        @Override
        public String toString() {
            return "Data{" +
                    "id=" + id +
                    ", name='" + name + '\'' +
                    '}';
        }
    }
    

      

  • 相关阅读:
    洛谷模板汇总
    BZOJ1787【AHOI2008】Meet紧急集合 <LCA>
    HDU3068 最长回文 <Manacher>
    UVa12345 Dynamic len(set(a[L:R])) <带修莫队>
    BZOJ2038 小Z的袜子 <莫队>
    BZOJ1103【POI2007】大都市meg <树上差分+树状数组>
    BZOJ3226【SDOI2008】校门外的区间
    BZOJ1012【JSOI2008】最大数 <线段树>
    20170918~24周总结
    BZOJ1934【SHOI2007】善意的投票 <网络流>
  • 原文地址:https://www.cnblogs.com/typ1805/p/8068289.html
Copyright © 2020-2023  润新知