349. Intersection of Two Arrays

06-Binary-Search-Tree/02-Remove-Min-and-Max-in-BST/src/Solution.java

@@ -0,0 +1,7 @@
+/**
+ * @Auther: lss
+ * @Date: 2019/2/20 14:35
+ * @Description:
+ */
+public class Solution {
+}

06-Binary-Search-Tree/349-Intersection-of-Two-Arrays/src/Solution.java

@@ -0,0 +1,28 @@
+import java.util.ArrayList;
+import java.util.TreeSet;
+
+/**
+ * @Auther: lss
+ * @Date: 2019/2/20 14:35
+ * @Description:
+ */
+public class Solution {
+ public int[] intersection(int[] nums1, int[] nums2) {
+
+ TreeSet<Integer> set = new TreeSet<>();
+ for (int num : nums1)
+ set.add(num);
+
+ ArrayList<Integer> list = new ArrayList<>();
+ for (int num : nums2) {
+ if (set.contains(num)) {
+ list.add(num);
+ set.remove(num);
+ }
+ }
+ int[] res = new int[list.size()];
+ for (int i = 0; i < list.size(); i++)
+ res[i] = list.get(i);
+ return res;
+ }
+}