Przecięcie dwóch tablic Java

 public static void findIntersection(int arry1[],int arry1size,int arry2[],int arry2size){
    	HashSet<Integer> hs=new HashSet<Integer>();
    	for(int i=0;i<arry1size;i++){
    		for(int j=0;j<arry2size;j++){
    			if(arry1[i]==arry2[j]){
    				hs.add(arry1[i]);
    			}
    		}
    	}
    	
    	System.out.println(hs);
    }
Zaheer Khan