package cy;
import java.util.HashSet;
import java.util.Set;
public class SameChid {
public static Set<Integer> setMethod(int[] a,int[] b){
Set<Integer> set = new HashSet<Integer>();
Set<Integer> set2 = new HashSet<Integer>();
for(int i=0; i<a.length; i++) {
set.add(a[i]);
}
for(int j=0; j<b.length; j++) {
if(!set.add(b[j]))
set2.add(b[j]);
}
return set2;
}
public static int[] intersect(int[] a, int[] b) {
if (a[0] > b[b.length - 1] || b[0] > a[a.length - 1]) {
return new int[0];
}
int[] intersection = new int[Math.max(a.length, b.length)];
import java.util.HashSet;
import java.util.Set;
public class SameChid {
public static Set<Integer> setMethod(int[] a,int[] b){
Set<Integer> set = new HashSet<Integer>();
Set<Integer> set2 = new HashSet<Integer>();
for(int i=0; i<a.length; i++) {
set.add(a[i]);
}
for(int j=0; j<b.length; j++) {
if(!set.add(b[j]))
set2.add(b[j]);
}
return set2;
}
public static int[] intersect(int[] a, int[] b) {
if (a[0] > b[b.length - 1] || b[0] > a[a.length - 1]) {
return new int[0];
}
int[] intersection = new int[Math.max(a.length, b.length)];