def intersection(a,b):
return list(set(a)&set(b))
public int[] intersection(int[] a,int[] b){
Set<Integer> s=new HashSet<>();
for(int x:a) s.add(x);
Set<Integer> r=new HashSet<>();
for(int x:b) if(s.contains(x)) r.add(x);
return r.stream().mapToInt(n->n).toArray();
}
Python & operator one expression. Java needs loops and Stream.
def intersection(a,b):
return list(set(a)&set(b))
public int[] intersection(int[] a,int[] b){
Set<Integer> s=new HashSet<>();
for(int x:a) s.add(x);
Set<Integer> r=new HashSet<>();
for(int x:b) if(s.contains(x)) r.add(x);
return r.stream().mapToInt(n->n).toArray();
}
1. Convert to sets 2. Intersect