zoukankan      html  css  js  c++  java
  • 开发中CollectionUtils处理集合

    1.org.apache.commons.collections.CollectionUtils;

    使用这个工具类,帮我们处理一些集合的操作,非常方便

    //取并集
    public
    void testUnion(){ String[] arrayA = new String[] { "A", "B", "C", "D", "E", "F" }; String[] arrayB = new String[] { "B", "D", "F", "G", "H", "K" }; List<String> listA = Arrays.asList(arrayA); List<String> listB = Arrays.asList(arrayB); //2个数组取并集 System.out.println(ArrayUtils.toString(CollectionUtils.union(listA, listB))); //[A, B, C, D, E, F, G, H, K] }
    //取交集
    public void testIntersection(){
     String[] arrayA = new String[] { "A", "B", "C", "D", "E", "F" };
     String[] arrayB = new String[] { "B", "D", "F", "G", "H", "K" }; 
    List<String> listA = Arrays.asList(arrayA); 
    List<String> listB = Arrays.asList(arrayB); 
    //2个数组取交集 
    System.out.println(ArrayUtils.toString(CollectionUtils.intersection(listA, listB)));
     //[B, D, F] }
    //取补集
    public void testDisjunction(){ 
    String[] arrayA = new String[] { "A", "B", "C", "D", "E", "F" }; 
    String[] arrayB = new String[] { "B", "D", "F", "G", "H", "K" }; 
    List<String> listA = Arrays.asList(arrayA); 
    List<String> listB = Arrays.asList(arrayB); 
    //2个数组取交集 的补集 
    System.out.println(ArrayUtils.toString(CollectionUtils.disjunction(listA, listB))); 
    //[A, C, E, G, H, K] }
    //取差集 -----------这个在项目中用到了
    public void testSubtract(){ 
    String[] arrayA = new String[] { "A", "B", "C", "D", "E", "F" }; 
    String[] arrayB = new String[] { "B", "D", "F", "G", "H", "K" }; 
    List<String> listA = Arrays.asList(arrayA); 
    List<String> listB = Arrays.asList(arrayB); 
    //arrayA扣除arrayB 
    System.out.println(ArrayUtils.toString(CollectionUtils.subtract(listA, listB)));
     //[A, C, E] }
    

    参考链接:http://www.jianshu.com/p/906d3577000b

     

  • 相关阅读:
    【PA2014】【BZOJ3709】Bohater(贪心,排序)
    【POJ1328】Radar Installation(贪心,决策包容)
    【NOIP2002】【Luogu1032】字串变换
    【NOIP2010】【Luogu1199】三国游戏
    【NOIP2009】【Luogu1068】分数线划定
    【NOIP2002】【Luogu1036】选数
    【NOIP2004】【Luogu1085】不高兴的津津
    【NOIP2003】【luogu1042】乒乓球
    【NOIP2012】【Luogu1080】国王游戏(贪心,邻项交换)
    Jzoj4894 SJR的直线
  • 原文地址:https://www.cnblogs.com/inspred/p/7646745.html
Copyright © 2011-2022 走看看