java求“交、叉、并集”

01	package test;
02	 
03	import java.util.HashSet;
04	import java.util.Set;
05	 
06	public class Test {
07	     
08	    public static void main(String[] args) {
09	        Set<Integer> result = new HashSet<Integer>();
10	        Set<Integer> set1 = new HashSet<Integer>(){{
11	            add(1);
12	            add(3);
13	            add(5);
14	        }};
15	         
16	        Set<Integer> set2 = new HashSet<Integer>(){{
17	            add(1);
18	            add(2);
19	            add(3);
20	        }};
21	         
22	        result.clear();
23	        result.addAll(set1);
24	        result.retainAll(set2);
25	        System.out.println("交集："+result);
26	         
27	        result.clear();
28	        result.addAll(set1);
29	        result.removeAll(set2);
30	        System.out.println("差集："+result);
31	         
32	        result.clear();
33	        result.addAll(set1);
34	        result.addAll(set2);
35	        System.out.println("并集："+result);
36	         
37	    }
38	 
39	}