從Java中的arraylist獲取唯一對象的列表

Question

我有以下員工名單：

[Employee{id="1", NID="A123", wages=5000},
 Employee{id="2", NID="B123", wages=1000},
 Employee{id="3", NID="C123", wages=2000},
 Employee{id="4", NID="C123", wages=3000}]

我需要能夠僅檢索唯一的對象，並且在NID相同的地方，我需要檢索具有最大ID的對象。 所以最終清單應該像

[Employee{id="1", NID="A123", wages=5000},
 Employee{id="2", NID="B123", wages=1000},
 Employee{id="4", NID="C123", wages=3000}]

我知道可以使用嵌套的for循環來做到這一點，但是我想使用Java流來做到這一點。 通過使用分組依據，我可以找到列表中重復的員工，但是我仍然不知道如何獲取上面的列表。

 Map<String, List<Employee>> groupByNid = employeeList.stream().collect(Collectors.groupingBy(Employee::getNID));

感謝幫助。

阿什利

Answer 1

我提出以下建議：

    Collection<Employee> filteredEmployees = employeeList.stream()
            .collect(Collectors.toMap(
                    Employee::getNID, Function.identity(),
                    BinaryOperator.maxBy(Comparator.comparing(Employee::getID))
            )).values();

Answer 2

您可以使用NID字段作為鍵，然后在合並功能中選擇最高的ID字段來收集地圖：

List<Employee> employeeList = ...;
Collection<Employee> uniqueEmployees = employeeList.stream()
        .collect(Collectors.toMap(Employee::getNID, 
                Function.identity(), 
                (e1,e2) -> e1.getID().compareTo(e2.getID()) > 0 ? e1: e2)
        ).values();

Answer 3

你可以這樣做

Collection<Employee> emps = employees.stream()
        .collect(Collectors.collectingAndThen(Collectors.toMap(Employee::getNID, Function.identity(),
                (e1, e2) -> e1.getId().compareTo(e2.getId()) > 0 ? e1 : e2), m -> m.values()));

Answer 4

嘗試這個：

    List<Employee> list = new ArrayList<>();

    list.add(new Employee(1,"A123",5000));
    list.add(new Employee(2,"B123",1000));
    list.add(new Employee(3,"C123",2000));
    list.add(new Employee(4,"C123",2000));


    Set<String> empSet = new HashSet<>();
    list.removeIf(p -> !empSet.add(p.getNid()));
    list.forEach(emp->System.out.println(emp.getId() +" : "+emp.getNid()+" :"+emp.getWage()));

Answer 5

您可以這樣做：

employeeList.stream().collect(Collectors.toMap(
        Employee::getNID, r -> r, (e1, e2) ->  e1.getId().compareTo(e2.getId()) > 0 ? e1 : e2));

Answer 6

@Test
public void t() {
    Employee e1 = new Employee(1, "A123", 400);
    Employee e2 = new Employee(2, "A123", 400);

    List<Employee> list = Arrays.asList(e1,e2);

    list = list.stream().filter(distinctByNid(Employee::getNid)).collect(Collectors.toList());
    System.out.println(list);
}

// use a thread safe set to dedup
public static <T> Predicate<T> distinctByNid(Function<? super T, ?> keyExtractor) {
    Set<Object> seen = ConcurrentHashMap.newKeySet();
    return t -> seen.add(keyExtractor.apply(t));
}

static class Employee {
    private int id;
    private String nid;
    private int wages;

    public Employee(int id, String nid, int wages) {
        this.id = id;
        this.nid = nid;
        this.wages = wages;
    }

    public int getId() {
        return id;
    }

    public void setId(int id) {
        this.id = id;
    }

    public String getNid() {
        return nid;
    }

    public void setNid(String nid) {
        this.nid = nid;
    }

    public int getWages() {
        return wages;
    }

    public void setWages(int wages) {
        this.wages = wages;
    }

    @Override
    public String toString() {
        return "Employee{" +
                "id=" + id +
                ", nid='" + nid + '\'' +
                ", wages=" + wages +
                '}';
    }
}