java集合算法

阳光穿透心脏的1/2处 2022-06-01 00:41 54阅读 0赞

package com.zr.List;
    
    import java.util.Arrays;
    import java.util.Collection;
    import java.util.Collections;
    import java.util.List;
    
    import org.apache.commons.collections.CollectionUtils;
    /**
     *  集合算法
     */
    public class CollectionUtilsOpt {
    	
    	public static void main(String[] args) {
    		
    		   String[] arrayA = new String[] { "1", "2", "3", "3", "4", "5" };      
    		   String[] arrayB = new String[] { "3", "4", "4", "5", "6", "7" };              
    		   List<String> a = Arrays.asList(arrayA);      
    		   List<String> b = Arrays.asList(arrayB);      
    		   //并集      
    		   Collection<String> union = CollectionUtils.union(a, b);      
    		   //交集      
    		   Collection<String> intersection = CollectionUtils.intersection(a, b);      
    		   //交集的补集      
    		   Collection<String> disjunction = CollectionUtils.disjunction(a, b);      
    		   //集合相减      
    		   Collection<String> subtract = CollectionUtils.subtract(a, b);   
    		   
    		   Collections.sort((List<String>) union);      
    		   Collections.sort((List<String>) intersection);      
    		   Collections.sort((List<String>) disjunction);		   
    		   Collections.sort((List<String>) subtract);     
    		   
    		   System.out.println("A: " + Arrays.toString(a.toArray()));      
    		   System.out.println("B: " + Arrays.toString(b.toArray()));      
    		   System.out.println("--------------------------------------------");      
    		   System.out.println("并集Union(A, B): " + Arrays.toString(union.toArray()));      
    		   System.out.println("交集Intersection(A, B): " + Arrays.toString(intersection.toArray()));      
    		   System.out.println("交集的补集Disjunction(A, B): " + Arrays.toString(disjunction.toArray()));      
    		   System.out.println("差集Subtract(A, B): " + Arrays.toString(subtract.toArray()));      
    		        
    	}
    
    }