java1.8 list 多条件排序

本文提供了一个使用Java进行对象列表排序的例子,展示了如何根据订单ID降序及用户ID的不同顺序进行排序。通过Comparator接口实现了多种排序逻辑,包括订单ID降序、用户ID升序或降序等。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

public static void main(String[] args) {


    String orderId1 = "2321837281372913";
    String userId1 = "20180701001";
    String orderId2 = "2321837281372914";
    String userId2 = "20180701002";
    String orderId3 = "2321837281372912";
    String userId3 = "20180701003";
    String orderId5 = "2321837281372918";
    String userId5 = "20180701004";
    String orderId6 = "2321837281372918";
    String userId6 = "20180701009";
    String orderId4 = "2321837281372918";
    String userId4 = "20180701005";
    
    Order order = new Order();
    order.setUserId(userId1);
    order.setOrderId(orderId1);
    Order order1 = new Order();
    order1.setOrderId(orderId2);
    order1.setUserId(userId2);

    Order order2 = new Order();
    order2.setOrderId(orderId3);
    order2.setUserId(userId3);
    Order order3 = new Order();
    order3.setOrderId(orderId4);
    order3.setUserId(userId4);
    Order order4 = new Order();
    order4.setOrderId(orderId5);
    order4.setUserId(userId5);
    Order order5 = new Order();
    order5.setUserId(userId6);
    order5.setOrderId(orderId6);

    List<Order> orderList = new ArrayList<Order>();
    orderList.add(order);
    orderList.add(order1);
    orderList.add(order2);
    orderList.add(order3);
    orderList.add(order4);
    orderList.add(order5);

    System.out.println(orderList.toString());
    System.out.println("=========================");
    System.out.println("=======这样子就是以orderid降序,如果ordeid相同再以userid降序==================");
    orderList.sort(Comparator.comparing(Order::getOrderId).thenComparing(Order::getUserId).reversed());
    System.out.println(orderList.toString());

    System.out.println("=======这样子就是以orderid降序,如果ordeid相同再以userid升序==================");
    orderList.sort(Comparator.comparing(Order::getOrderId).reversed().thenComparing(Order::getUserId));
    System.out.println(orderList.toString());

    System.out.println("=======这样子就是以orderid升序,如果ordeid相同再以userid升序==================");
    orderList.sort(Comparator.comparing(Order::getOrderId).thenComparing(Order::getUserId));
    System.out.println(orderList.toString());

    System.out.println("=======这样子就是以orderid升序,如果ordeid相同再以userid降序==================");
          orderList.sort(Comparator.comparing(Order::getOrderId).reversed().thenComparing(Order::getUserId).reversed());
    System.out.println(orderList.toString());


}

watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3UwMTA3NzIyMzA=,size_16,color_FFFFFF,t_70

 

 

以下是 Java 1.8 JDK 中 List 分组排序的示例代码: ```java import java.util.*; import java.util.stream.Collectors; public class ListGroupingAndSortingExample { public static void main(String[] args) { // Sample data List<Employee> employees = Arrays.asList( new Employee("John", "Doe", 1000), new Employee("Jane", "Doe", 2000), new Employee("John", "Smith", 1500), new Employee("Jane", "Smith", 2500), new Employee("Bob", "Johnson", 3000), new Employee("Alice", "Johnson", 4000) ); // Grouping by last name and sorting by salary Map<String, List<Employee>> groupedAndSorted = employees.stream() .sorted(Comparator.comparingInt(Employee::getSalary)) .collect(Collectors.groupingBy(Employee::getLastName)); // Printing results groupedAndSorted.forEach((lastName, employeeList) -> { System.out.println("Employees with last name " + lastName + ":"); employeeList.forEach(System.out::println); }); } } class Employee { private String firstName; private String lastName; private int salary; public Employee(String firstName, String lastName, int salary) { this.firstName = firstName; this.lastName = lastName; this.salary = salary; } public String getFirstName() { return firstName; } public String getLastName() { return lastName; } public int getSalary() { return salary; } @Override public String toString() { return firstName + " " + lastName + " (salary: " + salary + ")"; } } ``` 这个示例代码将员工列表按照姓氏进行分组,并且按照薪水进行排序。最后,它将每个分组中的员工列表打印出来。你可以根据自己的需求修改这个示例代码。
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值