commit solution 349

Author: lxlxw

Diff for: index-tags.md

@@ -79,6 +79,7 @@
 |  [219](https://leetcode-cn.com/problems/contains-duplicate-ii)  |  [存在重复元素 ii](/solution/200-299/0219.contains-duplicate-ii/)  |  `数组`,`哈希表`  |  <font color=green>简单</font>  |✅ |
 |  [290](https://leetcode-cn.com/problems/word-pattern)  |  [单词规律](/solution/200-299/0290.word-pattern/)  |  `哈希表`  |  <font color=green>简单</font>  |✅ |
 |  [299](https://leetcode-cn.com/problems/bulls-and-cows)  |  [猜数字游戏](/solution/200-299/0299.bulls-and-cows/)  |  `哈希表`  |  <font color=green>简单</font>  |✅ |
+|  [349](https://leetcode-cn.com/problems/intersection-of-two-arrays)  |  [两个数组的交集](/solution/300-399/0349.intersection-of-two-arrays/)  |  `排序`,`哈希表`,`双指针`,`二分查找`  |  <font color=green>简单</font>  |✅ |
 
 #### **栈**
 
@@ -108,6 +109,7 @@
 |  [283](https://leetcode-cn.com/problems/move-zeroes)  |  [移动零](/solution/200-299/0283.move-zeroes/)  |  `数组`,`双指针`  |  <font color=green>简单</font>  |✅ |
 |  [344](https://leetcode-cn.com/problems/reverse-string)  |  [反转字符串](/solution/300-399/0344.reverse-string/)  |  `双指针`,`字符串`  |  <font color=green>简单</font>  |✅ |
 |  [345](https://leetcode-cn.com/problems/reverse-vowels-of-a-string)  |  [反转字符串中的元音字母](/solution/300-399/0345.reverse-vowels-of-a-string/)  |  `双指针`,`字符串`  |  <font color=green>简单</font>  |✅ |
+|  [349](https://leetcode-cn.com/problems/intersection-of-two-arrays)  |  [两个数组的交集](/solution/300-399/0349.intersection-of-two-arrays/)  |  `排序`,`哈希表`,`双指针`,`二分查找`  |  <font color=green>简单</font>  |✅ |
 
 #### **链表**
 
@@ -130,13 +132,15 @@
 |  [167](https://leetcode-cn.com/problems/two-sum-ii-input-array-is-sorted)  |  [两数之和 ii - 输入有序数组](/solution/100-199/0167.two-sum-ii---input-array-is-sorted/)  |  `数组`,`双指针`,`二分查找`  |  <font color=green>简单</font>  |✅ |
 |  [209](https://leetcode-cn.com/problems/minimum-size-subarray-sum)  |  [长度最小的子数组](/solution/200-299/0209.minimum-size-subarray-sum/)  |  `数组`,`双指针`,`二分查找`  |  <font color=blue>中等</font>  |✅ |
 |  [278](https://leetcode-cn.com/problems/first-bad-version)  |  [第一个错误的版本](/solution/200-299/0278.first-bad-version/)  |  `二分查找`  |  <font color=green>简单</font>  |✅ |
+|  [349](https://leetcode-cn.com/problems/intersection-of-two-arrays)  |  [两个数组的交集](/solution/300-399/0349.intersection-of-two-arrays/)  |  `排序`,`哈希表`,`双指针`,`二分查找`  |  <font color=green>简单</font>  |✅ |
 
 #### **排序**
 
 |  题号  |  题解  |  标签  | 难度  | 是否解题 |
 | --- | --- | --- | --- | --- |
 |  [56](https://leetcode-cn.com/problems/merge-intervals)  |  [合并区间](/solution/1-99/0056.merge-intervals/)  |  `排序`,`数组`  |  <font color=blue>中等</font>  |✅ |
 |  [75](https://leetcode-cn.com/problems/sort-colors)  |  [颜色分类](/solution/1-99/0075.sort-colors/)  |  `排序`,`数组`,`双指针`  |  <font color=blue>中等</font>  |✅ |
+|  [349](https://leetcode-cn.com/problems/intersection-of-two-arrays)  |  [两个数组的交集](/solution/300-399/0349.intersection-of-two-arrays/)  |  `排序`,`哈希表`,`双指针`,`二分查找`  |  <font color=green>简单</font>  |✅ |
 
 #### **队列**
 

Diff for: index-type.md

@@ -103,7 +103,7 @@
 |  [344](https://leetcode-cn.com/problems/reverse-string)  |  [反转字符串](/solution/300-399/0344.reverse-string/)  |  `双指针`,`字符串`  |  <font color=green>简单</font>  |✅ |
 |  [345](https://leetcode-cn.com/problems/reverse-vowels-of-a-string)  |  [反转字符串中的元音字母](/solution/300-399/0345.reverse-vowels-of-a-string/)  |  `双指针`,`字符串`  |  <font color=green>简单</font>  |✅ |
 |  [346](https://leetcode-cn.com/problems/moving-average-from-data-stream)  |  [数据流中的移动平均值](/solution/300-399/0346.moving-average-from-data-stream/)  |  `设计`,`队列`  |  <font color=green>简单</font>  |
-|  [349](https://leetcode-cn.com/problems/intersection-of-two-arrays)  |  [两个数组的交集](/solution/300-399/0349.intersection-of-two-arrays/)  |  `排序`,`哈希表`,`双指针`,`二分查找`  |  <font color=green>简单</font>  |
+|  [349](https://leetcode-cn.com/problems/intersection-of-two-arrays)  |  [两个数组的交集](/solution/300-399/0349.intersection-of-two-arrays/)  |  `排序`,`哈希表`,`双指针`,`二分查找`  |  <font color=green>简单</font>  |✅ |
 |  [350](https://leetcode-cn.com/problems/intersection-of-two-arrays-ii)  |  [两个数组的交集 ii](/solution/300-399/0350.intersection-of-two-arrays-ii/)  |  `排序`,`哈希表`,`双指针`,`二分查找`  |  <font color=green>简单</font>  |
 |  [359](https://leetcode-cn.com/problems/logger-rate-limiter)  |  [日志速率限制器](/solution/300-399/0359.logger-rate-limiter/)  |  `设计`,`哈希表`  |  <font color=green>简单</font>  |
 |  [367](https://leetcode-cn.com/problems/valid-perfect-square)  |  [有效的完全平方数](/solution/300-399/0367.valid-perfect-square/)  |  `数学`,`二分查找`  |  <font color=green>简单</font>  |

Diff for: solution/300-399/0349.intersection-of-two-arrays/README.md

@@ -0,0 +1,59 @@
+# [349. 两个数组的交集](https://leetcode-cn.com/problems/intersection-of-two-arrays/description/)
+
+### 题目描述
+
+<p>给定两个数组，编写一个函数来计算它们的交集。</p>
+
+<p>&nbsp;</p>
+
+<p><strong>示例 1：</strong></p>
+
+<pre><strong>输入：</strong>nums1 = [1,2,2,1], nums2 = [2,2]
+<strong>输出：</strong>[2]
+</pre>
+
+<p><strong>示例 2：</strong></p>
+
+<pre><strong>输入：</strong>nums1 = [4,9,5], nums2 = [9,4,9,8,4]
+<strong>输出：</strong>[9,4]</pre>
+
+<p>&nbsp;</p>
+
+<p><strong>说明：</strong></p>
+
+<ul>
+	<li>输出结果中的每个元素一定是唯一的。</li>
+	<li>我们可以不考虑输出结果的顺序。</li>
+</ul>
+
+### 解题思路
+
+1. hash table
+
+### 具体解法
+
+
+#### **Golang**
+```go
+func intersection(nums1 []int, nums2 []int) []int {
+	if len(nums1) == 0 || len(nums2) == 0 {
+		return []int{}
+	}
+	num1Map := make(map[int]bool)
+
+	for i := range nums1 {
+		num1Map[nums1[i]] = true
+	}
+	num2Map := make(map[int]bool)
+	var res []int
+	for i := range nums2 {
+		if _, ok1 := num1Map[nums2[i]]; ok1 && !num2Map[nums2[i]] {
+			num2Map[nums2[i]] = true
+			res = append(res, nums2[i])
+		}
+	}
+	return res
+}
+```
+
+

Diff for: solution/300-399/0349.intersection-of-two-arrays/solution.go

@@ -0,0 +1,30 @@
+package leetcode
+
+/*
+ * @lc app=leetcode.cn id=349 lang=golang
+ *
+ * [349] 两个数组的交集
+ */
+
+// @lc code=start
+func intersection(nums1 []int, nums2 []int) []int {
+	if len(nums1) == 0 || len(nums2) == 0 {
+		return []int{}
+	}
+	num1Map := make(map[int]bool)
+
+	for i := range nums1 {
+		num1Map[nums1[i]] = true
+	}
+	num2Map := make(map[int]bool)
+	var res []int
+	for i := range nums2 {
+		if _, ok1 := num1Map[nums2[i]]; ok1 && !num2Map[nums2[i]] {
+			num2Map[nums2[i]] = true
+			res = append(res, nums2[i])
+		}
+	}
+	return res
+}
+
+// @lc code=end

Diff for: solution/300-399/0349.intersection-of-two-arrays/solution_test.go

@@ -0,0 +1,31 @@
+package leetcode
+
+import (
+	"fmt"
+	"testing"
+)
+
+func TestIntersection(t *testing.T) {
+	var nums1 []int
+	var nums2 []int
+	var ret []int
+
+	nums1 = []int{1, 2, 2, 1}
+	nums2 = []int{2, 2}
+	ret = []int{2}
+	for i, v := range intersection(nums1, nums2) {
+		if v != ret[i] {
+			t.Fatalf("case fails %v\n", ret)
+		}
+	}
+
+	nums1 = []int{}
+	nums2 = []int{2, 2}
+	ret = []int{}
+	fmt.Println(intersection(nums1, nums2))
+	for i, v := range intersection(nums1, nums2) {
+		if v != ret[i] {
+			t.Fatalf("case fails %v\n", ret)
+		}
+	}
+}

Diff for: solution/300-399/_sidebar.md

@@ -55,7 +55,7 @@
     - [346. 数据流中的移动平均值](solution/300-399/0346.moving-average-from-data-stream/)
     - [347. 前 k 个高频元素](solution/300-399/0347.top-k-frequent-elements/)
     - [348. 判定井字棋胜负](solution/300-399/0348.design-tic-tac-toe/)
-    - [349. 两个数组的交集](solution/300-399/0349.intersection-of-two-arrays/)
+    - [349. 两个数组的交集 ✅](solution/300-399/0349.intersection-of-two-arrays/)
     - [350. 两个数组的交集 ii](solution/300-399/0350.intersection-of-two-arrays-ii/)
     - [351. 安卓系统手势解锁](solution/300-399/0351.android-unlock-patterns/)
     - [352. 将数据流变为多个不相交区间](solution/300-399/0352.data-stream-as-disjoint-intervals/)