3

hitzzc · hitzzc · commit 983afbfd8717 · 2016-10-17T16:17:33.000+08:00
diff --git a/README.md b/README.md
@@ -174,6 +174,9 @@ Golang solution for leetcode. For each problem, there is a simple *_test.go to t
 #### [214. Shortest Palindrome (unsolved)](https://github.com/hitzzc/go-leetcode/tree/master/shortest_palindrome)
 #### [215. Kth Largest Element in an Array](https://github.com/hitzzc/go-leetcode/tree/master/kth_largest_element_in_an_array)
 #### [216. Combination Sum III](https://github.com/hitzzc/go-leetcode/tree/master/combinations_sum_III)
+#### [217. Contains Duplicate](https://github.com/hitzzc/go-leetcode/tree/master/contains_duplicate)
+#### [218. Contains Duplicate II](https://github.com/hitzzc/go-leetcode/tree/master/contains_duplicate_II)
+#### [219. Contains Duplicate III (unsolved)](https://github.com/hitzzc/go-leetcode/tree/master/contains_duplicate_III)
 
 
 
diff --git a/contains_duplicate/contains_duplicate.go b/contains_duplicate/contains_duplicate.go
@@ -0,0 +1,12 @@
+package contains_duplicate
+
+func containsDuplicate(nums []int) bool {
+	m := map[int]bool{}
+	for i := range nums {
+		if m[nums[i]] {
+			return true
+		}
+		m[nums[i]] = true
+	}
+	return false
+}
diff --git a/contains_duplicate_II/contains_duplicate_II.go b/contains_duplicate_II/contains_duplicate_II.go
@@ -0,0 +1,14 @@
+package contains_duplicate_II
+
+func containsNearbyDuplicate(nums []int, k int) bool {
+	m := map[int]int{}
+	for i := range nums {
+		if j, ok := m[nums[i]]; ok {
+			if i-j <= k {
+				return true
+			}
+		}
+		m[nums[i]] = i
+	}
+	return false
+}
diff --git a/contains_duplicate_III/contains_duplicate_III.go b/contains_duplicate_III/contains_duplicate_III.go
@@ -0,0 +1,5 @@
+package contains_duplicate_III
+
+func containsNearbyAlmostDuplicate(nums []int, k int, t int) bool {
+
+}

-Original file line number
+Diff line change
@@ @@ -0,0 +1,5 @@ @@
 +package contains_duplicate_III
++
 +func containsNearbyAlmostDuplicate(nums []int, k int, t int) bool {
++
 +}