feat: add python and java solutions to leetcode problem: No.0349

Author: yanglbme

solution/0300-0399/0349.Intersection of Two Arrays/README.md

@@ -36,15 +36,38 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def intersection(self, nums1: List[int], nums2: List[int]) -> List[int]:
+        s1, s2 = set(nums1), set(nums2)
+        return list(s1 & s2)
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+class Solution {
+    public int[] intersection(int[] nums1, int[] nums2) {
+        Set<Integer> s1 = transfer(nums1);
+        Set<Integer> s2 = transfer(nums2);
+        s1.retainAll(s2);
+        int[] output = new int[s1.size()];
+        int i = 0;
+        for (Integer e : s1) {
+            output[i++] = e;
+        }
+        return output;
+    }
+
+    private Set<Integer> transfer(int[] nums) {
+        Set<Integer> s = new HashSet<>();
+        for (int e : nums) {
+            s.add(e);
+        }
+        return s;
+    }
+}
 ```
 
 ### **...**

solution/0300-0399/0349.Intersection of Two Arrays/README_EN.md

@@ -44,13 +44,36 @@
 ### **Python3**
 
 ```python
-
+class Solution:
+    def intersection(self, nums1: List[int], nums2: List[int]) -> List[int]:
+        s1, s2 = set(nums1), set(nums2)
+        return list(s1 & s2)
 ```
 
 ### **Java**
 
 ```java
-
+class Solution {
+    public int[] intersection(int[] nums1, int[] nums2) {
+        Set<Integer> s1 = transfer(nums1);
+        Set<Integer> s2 = transfer(nums2);
+        s1.retainAll(s2);
+        int[] output = new int[s1.size()];
+        int i = 0;
+        for (Integer e : s1) {
+            output[i++] = e;
+        }
+        return output;
+    }
+
+    private Set<Integer> transfer(int[] nums) {
+        Set<Integer> s = new HashSet<>();
+        for (int e : nums) {
+            s.add(e);
+        }
+        return s;
+    }
+}
 ```
 
 ### **...**

solution/0300-0399/0349.Intersection of Two Arrays/Solution.java

@@ -1,15 +1,21 @@
 class Solution {
     public int[] intersection(int[] nums1, int[] nums2) {
-        HashSet<Integer> set1 = new HashSet<Integer>();
-        for (Integer n : nums1) set1.add(n);
-        HashSet<Integer> set2 = new HashSet<Integer>();
-        for (Integer n : nums2) set2.add(n);
-
-        set1.retainAll(set2);
-
-        int [] output = new int[set1.size()];
-        int idx = 0;
-        for (int s : set1) output[idx++] = s;
+        Set<Integer> s1 = transfer(nums1);
+        Set<Integer> s2 = transfer(nums2);
+        s1.retainAll(s2);
+        int[] output = new int[s1.size()];
+        int i = 0;
+        for (Integer e : s1) {
+            output[i++] = e;
+        }
         return output;
     }
+
+    private Set<Integer> transfer(int[] nums) {
+        Set<Integer> s = new HashSet<>();
+        for (int e : nums) {
+            s.add(e);
+        }
+        return s;
+    }
 }

solution/0300-0399/0349.Intersection of Two Arrays/Solution.py

@@ -1,4 +1,4 @@
 class Solution:
-    def intersection(self, nums1: 'List[int]', nums2: 'List[int]') -> 'List[int]':
-
-        return list(set(nums1).intersection(set(nums2)))
+    def intersection(self, nums1: List[int], nums2: List[int]) -> List[int]:
+        s1, s2 = set(nums1), set(nums2)
+        return list(s1 & s2)