java 实现集合的交差并补

版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/sdz20172133/article/details/84453390

package Work1;


import java.util.ArrayList;
import java.util.HashSet;
import java.util.List;
import java.util.Set;

public class Work1 {
	public static void main(String[] args)
	{
		
		List <Integer> list=new ArrayList<Integer>();
		list.add(1);
		list.add(2);
		list.add(3);
		list.add(4);
		List<Integer> list2=new ArrayList<Integer>();
		list2.add(1);
		list2.add(3);
		list2.add(5);
		list2.add(7);
		list2.add(9);
		list2.add(11);
		
		boolean isContains=list.retainAll(list2);
		//System.out.println(isContains);
		System.out.println("两个集合的交集:");
		for(Integer c:list)
		{
			System.out.print(c+" ");
		}
		System.out.println();
		boolean notContains1=list2.removeAll(list);
		//System.out.println(notContains1);
		System.out.println("差集");                    
		for(Integer c:list2)
		{
			System.out.print(c+" ");
		}
		System.out.println();
		/*boolean notContains2=list.removeAll(list2);
		System.out.println(notContains2);
		System.out.println("差集");                    
		for(Integer c:list)
		{
			System.out.println(c);
		}*///错误
		
		//求并集
		Set<Integer>set1=new HashSet<Integer>();
		set1.addAll(list);
		set1.addAll(list2);
		System.out.println("两个集合的并集");
		for(Integer it:set1)
		{
			System.out.print(it+" ");
		}
		System.out.println();
		
		
		
		
		
	}

}

猜你喜欢

转载自blog.csdn.net/sdz20172133/article/details/84453390