Update 349.intersection-of-two-arrays.md

Author: azl397985856

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

@@ -33,7 +33,7 @@ The result can be in any order.
 
 ## 关键点解析
 
-无
+- 空间换时间
 
 ## 代码
 
@@ -42,46 +42,6 @@ The result can be in any order.
 Javascript Code:
 
 ```js
-/*
- * @lc app=leetcode id=349 lang=javascript
- *
- * [349] Intersection of Two Arrays
- *
- * https://leetcode.com/problems/intersection-of-two-arrays/description/
- *
- * algorithms
- * Easy (53.11%)
- * Total Accepted:    203.6K
- * Total Submissions: 380.9K
- * 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
  * @param {number[]} nums2
@@ -128,3 +88,13 @@ class Solution:
     def intersection(self, nums1: List[int], nums2: List[int]) -> List[int]:
         return set(nums1) & set(nums2)
 ```
+**复杂度分析**
+- 时间复杂度：$O(N)$
+- 空间复杂度：$O(N)$
+
+更多题解可以访问我的LeetCode题解仓库：https://github.com/azl397985856/leetcode  。 目前已经35K star啦。
+
+关注公众号力扣加加，努力用清晰直白的语言还原解题思路，并且有大量图解，手把手教你识别套路，高效刷题。
+
+
+![](https://tva1.sinaimg.cn/large/007S8ZIlly1gfcuzagjalj30p00dwabs.jpg)