feat: commit solution 217

Author: lxlxw

_sidebar.md

@@ -22,6 +22,9 @@
   - [83.删除排序链表中的重复元素 ✅](solution/1-99/0083.remove-duplicates-from-sorted-list/)
   - [88.合并两个有序数组 ✅](solution/1-99/0088.merge-sorted-array/)
   - [125.验证回文串 ✅](solution/100-199/0125.valid-palindrome/)
+  - [217.存在重复元素 ✅](solution/200-299/0217.contains-duplicate/)
+  - [219.存在重复元素 II ✅](solution/200-299/0219.contains-duplicate-ii/)
+  
 
 
 

index-tags.md

@@ -30,13 +30,16 @@
 |  [35](https://leetcode-cn.com/problems/search-insert-position)  |  [搜索插入位置](/solution/1-99/0035.search-insert-position/)  |  `数组`,`二分查找`  |  <font color=green>简单</font>  |✅ |
 |  [66](https://leetcode-cn.com/problems/plus-one)  |  [加一](/solution/1-99/0066.plus-one/)  |  `数组`  |  <font color=green>简单</font>  |✅ |
 |  [88](https://leetcode-cn.com/problems/merge-sorted-array)  |  [合并两个有序数组](/solution/1-99/0088.merge-sorted-array/)  |  `数组`,`双指针`  |  <font color=green>简单</font>  |✅ |
-
+|  [217](https://leetcode-cn.com/problems/contains-duplicate)  |  [存在重复元素](/solution/200-299/0217.contains-duplicate/)  |  `数组`,`哈希表`  |  <font color=green>简单</font>  |✅ |
+|  [219](https://leetcode-cn.com/problems/contains-duplicate-ii)  |  [存在重复元素 ii](/solution/200-299/0219.contains-duplicate-ii/)  |  `数组`,`哈希表`  |  <font color=green>简单</font>  |✅ |
 
 #### **哈希表**
 
 |  题号  |  题解  |  标签  | 难度  | 是否解题 |
 | --- | --- | --- | --- | --- |
 |  [1](https://leetcode-cn.com/problems/two-sum)  |  [两数之和](/solution/1-99/0001.two-sum/)  |  `数组`,`哈希表`  |  <font color=green>简单</font>  | ✅ |
+|  [217](https://leetcode-cn.com/problems/contains-duplicate)  |  [存在重复元素](/solution/200-299/0217.contains-duplicate/)  |  `数组`,`哈希表`  |  <font color=green>简单</font>  |✅ |
+|  [219](https://leetcode-cn.com/problems/contains-duplicate-ii)  |  [存在重复元素 ii](/solution/200-299/0219.contains-duplicate-ii/)  |  `数组`,`哈希表`  |  <font color=green>简单</font>  |✅ |
 
 #### **栈**
 

index-type.md

@@ -69,8 +69,8 @@
 |  [204](https://leetcode-cn.com/problems/count-primes)  |  [计数质数](/solution/200-299/0204.count-primes/)  |  `哈希表`,`数学`  |  <font color=green>简单</font>  |
 |  [205](https://leetcode-cn.com/problems/isomorphic-strings)  |  [同构字符串](/solution/200-299/0205.isomorphic-strings/)  |  `哈希表`  |  <font color=green>简单</font>  |
 |  [206](https://leetcode-cn.com/problems/reverse-linked-list)  |  [反转链表](/solution/200-299/0206.reverse-linked-list/)  |  `链表`  |  <font color=green>简单</font>  |
-|  [217](https://leetcode-cn.com/problems/contains-duplicate)  |  [存在重复元素](/solution/200-299/0217.contains-duplicate/)  |  `数组`,`哈希表`  |  <font color=green>简单</font>  |
-|  [219](https://leetcode-cn.com/problems/contains-duplicate-ii)  |  [存在重复元素 ii](/solution/200-299/0219.contains-duplicate-ii/)  |  `数组`,`哈希表`  |  <font color=green>简单</font>  |
+|  [217](https://leetcode-cn.com/problems/contains-duplicate)  |  [存在重复元素](/solution/200-299/0217.contains-duplicate/)  |  `数组`,`哈希表`  |  <font color=green>简单</font>  |✅ |
+|  [219](https://leetcode-cn.com/problems/contains-duplicate-ii)  |  [存在重复元素 ii](/solution/200-299/0219.contains-duplicate-ii/)  |  `数组`,`哈希表`  |  <font color=green>简单</font>  |✅ |
 |  [225](https://leetcode-cn.com/problems/implement-stack-using-queues)  |  [用队列实现栈](/solution/200-299/0225.implement-stack-using-queues/)  |  `栈`,`设计`  |  <font color=green>简单</font>  |
 |  [226](https://leetcode-cn.com/problems/invert-binary-tree)  |  [翻转二叉树](/solution/200-299/0226.invert-binary-tree/)  |  `树`  |  <font color=green>简单</font>  |
 |  [231](https://leetcode-cn.com/problems/power-of-two)  |  [2的幂](/solution/200-299/0231.power-of-two/)  |  `位运算`,`数学`  |  <font color=green>简单</font>  |

solution/200-299/0217.contains-duplicate/README.md

@@ -0,0 +1,51 @@
+# [217.存在重复元素](https://leetcode-cn.com/problems/contains-duplicate/)
+
+
+### 题目描述
+
+<div class="notranslate"><p>给定一个整数数组，判断是否存在重复元素。</p>
+
+<p>如果任意一值在数组中出现至少两次，函数返回 <code>true</code> 。如果数组中每个元素都不相同，则返回 <code>false</code> 。</p>
+
+<p>&nbsp;</p>
+
+<p><strong>示例 1:</strong></p>
+
+<pre><strong>输入:</strong> [1,2,3,1]
+<strong>输出:</strong> true</pre>
+
+<p><strong>示例 2:</strong></p>
+
+<pre><strong>输入: </strong>[1,2,3,4]
+<strong>输出:</strong> false</pre>
+
+<p><strong>示例&nbsp;3:</strong></p>
+
+<pre><strong>输入: </strong>[1,1,1,3,3,4,3,2,4,2]
+<strong>输出:</strong> true</pre>
+</div>
+
+### 解题思路
+
+1. 利用hash表来实现
+
+### 代码实现
+
+<!-- tabs:start -->
+
+#### **Golang**
+```go
+func containsDuplicate(nums []int) bool {
+	var numMap = make(map[int]int, 0)
+	for k, v := range nums {
+		if _, ok := numMap[v]; ok {
+			return true
+		}
+		numMap[v] = k
+	}
+	return false
+}
+```
+
+
+<!-- tabs:end -->

solution/200-299/0217.contains-duplicate/solution.go

@@ -0,0 +1,21 @@
+package leetcode
+
+/*
+ * @lc app=leetcode.cn id=217 lang=golang
+ *
+ * [217] 存在重复元素
+ */
+
+// @lc code=start
+func containsDuplicate(nums []int) bool {
+	var numMap = make(map[int]int, 0)
+	for k, v := range nums {
+		if _, ok := numMap[v]; ok {
+			return true
+		}
+		numMap[v] = k
+	}
+	return false
+}
+
+// @lc code=end

solution/200-299/0217.contains-duplicate/solution_test.go

@@ -0,0 +1,22 @@
+package leetcode
+
+import (
+	"testing"
+)
+
+func TestPlusOne(t *testing.T) {
+	var nums []int
+	var ret bool
+
+	nums = []int{1, 2, 3, 1}
+	ret = true
+	if ret != containsDuplicate(nums) {
+		t.Fatalf("case fails: %v\n", ret)
+	}
+
+	nums = []int{1, 2, 3, 4}
+	ret = false
+	if ret != containsDuplicate(nums) {
+		t.Fatalf("case fails: %v\n", ret)
+	}
+}