zoukankan      html  css  js  c++  java
  • 匿名内部类转换lambdas取代,以极大地提高源代码的可读性

    myCollection.stream().map(new Mapper<String,String>() {
      public String map(String input) {
        return new StringBuilder(input).reverse().toString();
      }
    });
    
    Predicate<String> isEmpty = new Predicate<String> {
        boolean test(String myString) {
            return myString.isEmpty();
        }
    }
    
    myCollection.stream().map(input -> new StringBuilder(input).reverse().toString());
    
    Predicate<String> isEmpty = myString -> myString.isEmpty();

     例子:

    public static List<Integer> getDiffNum(int i) {
            List<Integer> rs = new ArrayList<>();
            Integer[] numsTmp = nums.clone();
            for (int j = 0; j < i; j++) {
                int len = rand.nextInt(numsTmp.length);
                int tN = numsTmp[len];
                rs.add(tN);
                List<Integer> asList = transferArrayToList(numsTmp);
                asList.remove(len);
                Integer[] intes =new Integer[asList.size()];
                numsTmp = asList.toArray(intes);
            }
            rs.sort(new Comparator<Integer>() {
    
                @Override
                public int compare(Integer a, Integer b) {
                    return a.compareTo(b);
                }
                
            });
            return rs;
        }

    转换后:

    public static List<Integer> getDiffNum(int i) {
            List<Integer> rs = new ArrayList<>();
            Integer[] numsTmp = nums.clone();
            for (int j = 0; j < i; j++) {
                int len = rand.nextInt(numsTmp.length);
                int tN = numsTmp[len];
                rs.add(tN);
                List<Integer> asList = transferArrayToList(numsTmp);
                asList.remove(len);
                Integer[] intes =new Integer[asList.size()];
                numsTmp = asList.toArray(intes);
            }
            rs.sort((a,b) -> a.compareTo(b));
            return rs;
        }
  • 相关阅读:
    2.完全背包问题
    1.01背包问题
    19.区间合并
    18.区间和
    16.数组元素的目标和
    15.最长连续不重复子序列
    14.差分矩阵
    1.注册七牛云账号
    1.1 linux查看系统基本参数常用命令
    图书管理增删改查&父子调用&前后端
  • 原文地址:https://www.cnblogs.com/zyf-yxm/p/13497897.html
Copyright © 2011-2022 走看看