文章链接:http://blog.163.com/asd_wll/blog/static/210310402010112833332260/
练习:
求集合A和集合B的交集
import java.util.HashSet;
import java.util.Iterator;
public class SetPractice {
public static void main(String[] args) {
HashSet hs = new HashSet();
int[] arrA = new int[]{1,56,32,4,6,8,3,5,9,0};
int[] arrB = new int[]{5,23,32,7,6,22,4,33,10,9};
System.out.println("集合A");
for(int i = 0; i < arrA.length; i++){
System.out.print(arrA[i] + " ");
}
System.out.println();
System.out.println("集合B");
for(int i = 0; i < arrA.length; i++){
System.out.print(arrB[i] + " ");
}
System.out.println();
System.out.println("集合A和集合B的交集");
int x = 0;
while( x != 18){
if(x<=9){
hs.add(new Integer(arrA[x]));
x++;
}
if(x>9){
hs.add(new Integer(arrB[x-10]));
x++;
}
}
Iterator it=hs.iterator();
while(it.hasNext())
{
Object o=it.next();
System.out.print(o + " ");
}
}
}