zoukankan      html  css  js  c++  java
  • list通过lambda 表达式去重,筛选

    List<User> distinctList = new ArrayList();
    User user1 = new User();
    user1.setId("111");
    distinctList.add(user1);
    User user2 = new User();
    user2.setId("222");
    distinctList.add(user2);
    User user3 = new User();
    user3.setId("333");
    distinctList.add(user3);
    User user4 = new User();
    user4.setId("333");
    distinctList.add(user4);
    List<User> res = distinctList.stream().collect(//list是需要去重的list,返回值是去重后的list
    Collectors.collectingAndThen(Collectors.toCollection(() -> new TreeSet<>(Comparator.comparing(o -> o.getId()))), ArrayList::new));
    //筛选
    res = distinctList.stream().filter(ls->ls.getId().equals("222")).collect(Collectors.toList());

    System.out.println(res);


    获取最大最小值

    public class GetMax {

    public static void main(String[] args) {

    List<Integer> num = new ArrayList<Integer>();
    num .add(1);
    num .add(2);
    num .add(3);
    num .add(5);
    num .add(6);
    num .add(15);
    num .add(2);
    num .add(5);
    num .add(6);
    num .add(8);

    Integer max = num.stream().reduce(Integer::max).get();//得到最大值
    Integer min = num.stream().reduce(Integer::min).get();//得到最小值

    System.out.println(max);
    System.out.println(min);

    Integer sum = num.stream().reduce(0,(a, b) -> a + b);
    System.out.println(sum);
    }

  • 相关阅读:
    Unity3d之UGUI- Image拦截Button响应事件
    hdu1114Piggy-Bank(完全背包)
    cf455A boredom
    hdu2084数塔(入门级dp)
    小米线刷出现remote: partition table doesn't exist
    km算法
    hdu1069 Girls and Boys
    CF1203C Common Divisors
    魔法部落
    java命令行运行出现找不到或无法加载类
  • 原文地址:https://www.cnblogs.com/chafe/p/10334566.html
Copyright © 2011-2022 走看看