Find intersection of two arrays (unique)
Java
Hard
3 views
Problem Description
Task: return unique intersection of a and b.
Output Format
Return value
Constraints
Order does not matter.
Official Solution
static int[] intersection(int[] a,int[] b){java.util.HashSet<Integer> s=new java.util.HashSet<>();for(int x:a) s.add(x);java.util.HashSet<Integer> out=new java.util.HashSet<>();for(int x:b) if(s.contains(x)) out.add(x);int[] r=new int[out.size()];int i=0;for(int x:out) r[i++]=x;return r;}
Solutions (0)
No solutions submitted yet. Be the first!
No comments yet. Start the discussion!