add LC_349

yi-yun · yi-yun · commit 6152ea065e81 · 2019-06-24T22:59:55.000+08:00
diff --git a/java_test/src/main/java/com/yiyun/TestSet.java b/java_test/src/main/java/com/yiyun/TestSet.java
@@ -2,22 +2,24 @@
 
 import org.junit.Test;
 
+import java.util.Collections;
 import java.util.HashSet;
 import java.util.Set;
 
 public class TestSet {
     public static void main(String[] args) {
-        Set<Integer> set=new HashSet<>();
+        Set<Integer> set = new HashSet<>();
         set.add(1);
         System.out.println("set = " + set);
     }
+
     @Test
-    public void funadd(){
-        int[] a= new int[]{1, 2, 3, 4, 5};
-        int i=1;
+    public void funadd() {
+        int[] a = new int[]{1, 2, 3, 4, 5};
+        int i = 1;
         System.out.println("i= " + i++);
-        i=1;
+        i = 1;
         System.out.println("i = " + ++i);
-        
+
     }
 }
diff --git a/myoffer/src/main/java/leetcode/array/LC_349.java b/myoffer/src/main/java/leetcode/array/LC_349.java
@@ -0,0 +1,26 @@
+package leetcode.array;
+
+import java.util.ArrayList;
+import java.util.Arrays;
+import java.util.Collections;
+import java.util.HashSet;
+
+public class LC_349 {
+    public int[] intersection(int[] nums1, int[] nums2) {
+        HashSet<Integer> hashSet = new HashSet<>();
+        ArrayList<Integer> list = new ArrayList<>();
+        for (int a:nums1) {
+            hashSet.add(a);
+        }
+        for (int n:nums2) {
+            if (hashSet.remove(n)){
+                list.add(n);
+            }
+        }
+        int[] ints = new int[list.size()];
+        for (int i = 0; i < list.size(); i++) {
+            ints[i]=list.get(i);
+        }
+        return ints;
+    }
+}
