• jdk 1.8 新特性


    @Test
    public void testList() {
    ArrayList<Integer> arrayList = new ArrayList<>();
    arrayList.add(11);
    arrayList.add(22);
    arrayList.add(33);
    arrayList.add(44);
    arrayList.add(11);
    System.out.println("arrayList:" + arrayList);
    arrayList.stream().forEach(x -> {
    System.out.println("foreach:" + x);
    });
    System.out.println("------------------ filter ------------------------------");
    List<Integer> c = arrayList.stream().filter(x -> x.equals(33)).collect(Collectors.toList());
    System.out.println("filter:" + c);
    System.out.println("------------------ distinct ------------------------------");
    List<Integer> collect = arrayList.stream().distinct().collect(Collectors.toList());
    System.out.println("distinct:" + collect);
    System.out.println("------------------ limit ------------------------------");
    List<Integer> collect1 = arrayList.stream().limit(3).collect(Collectors.toList());
    System.out.println("limit:" + collect1);
    System.out.println("------------------ min ------------------------------");
    int minValue = arrayList.stream().min(Comparator.comparing(Integer::intValue)).get().intValue();
    System.out.println("max:" + minValue);
    System.out.println("------------------ max ------------------------------");
    int maxValue = arrayList.stream().max(Comparator.comparing(Integer::intValue)).get().intValue();
    System.out.println("max:" + maxValue);
    }
  • 相关阅读:
    Codeforces 1255B Fridge Lockers
    Codeforces 1255A Changing Volume
    Codeforces 1255A Changing Volume
    leetcode 112. 路径总和
    leetcode 129. 求根到叶子节点数字之和
    leetcode 404. 左叶子之和
    leetcode 104. 二叉树的最大深度
    leetcode 235. 二叉搜索树的最近公共祖先
    450. Delete Node in a BST
    树的c++实现--建立一棵树
  • 原文地址:https://www.cnblogs.com/ming-blogs/p/11903722.html
Copyright © 2020-2023  润新知