feat: 349.intersection-of-two-arrays add Python3 implementation (#147)

Author: ybian19

problems/349.intersection-of-two-arrays.md

@@ -32,6 +32,11 @@ The result can be in any order.
 无
 
 ## 代码
+
+* 语言支持：JS, Python
+
+Javascript Code:
+
 ```js
 /*
  * @lc app=leetcode id=349 lang=javascript
@@ -47,31 +52,31 @@ The result can be in any order.
  * Testcase Example:  '[1,2,2,1]\n[2,2]'
  *
  * Given two arrays, write a function to compute their intersection.
- * 
+ *
  * Example 1:
- * 
- * 
+ *
+ *
  * Input: nums1 = [1,2,2,1], nums2 = [2,2]
  * Output: [2]
- * 
- * 
- * 
+ *
+ *
+ *
  * Example 2:
- * 
- * 
+ *
+ *
  * Input: nums1 = [4,9,5], nums2 = [9,4,9,8,4]
  * Output: [9,4]
- * 
- * 
+ *
+ *
  * Note:
- * 
- * 
+ *
+ *
  * Each element in the result must be unique.
  * The result can be in any order.
- * 
- * 
- * 
- * 
+ *
+ *
+ *
+ *
  */
 /**
  * @param {number[]} nums1
@@ -101,3 +106,21 @@ var intersection = function(nums1, nums2) {
 };
 ```
 
+Python Code:
+
+```python
+class Solution:
+    def intersection(self, nums1: List[int], nums2: List[int]) -> List[int]:
+        visited, result = {}, []
+        for num in nums1:
+            visited[num] = num
+        for num in nums2:
+            if num in visited:
+                result.append(num)
+                visited.pop(num)
+        return result
+
+    # 另一种解法：利用 Python 中的集合进行计算
+    def intersection(self, nums1: List[int], nums2: List[int]) -> List[int]:
+        return set(nums1) & set(nums2)
+```